000 05580nam a22006255i 4500
001 978-3-540-72845-0
003 DE-He213
005 20240730191151.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540728450
_9978-3-540-72845-0
024 7 _a10.1007/978-3-540-72845-0
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aExperimental Algorithms
_h[electronic resource] :
_b6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings /
_cedited by Camil Demetrescu.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXIV, 450 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4525
505 0 _aInvited Lectures -- An Alternative Ranking Problem for Search Engines -- Engineering Fast Route Planning Algorithms -- Random Models for Geometric Graphs (Abstract) -- Session 1 (Route Planning) -- Better Landmarks Within Reach -- Landmark-Based Routing in Dynamic Graphs -- Dynamic Highway-Node Routing -- Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters) -- Dynamic Trees in Practice -- On the Cost of Persistence and Authentication in Skip Lists -- Cache-, Hash- and Space-Efficient Bloom Filters -- Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing) -- Crossing Minimization in Weighted Bipartite Graphs -- Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP -- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem -- Session 4 (Network Routing and Stability) -- Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks -- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks -- An Experimental Study of Stability in Heterogeneous Networks -- Session 5 (Strings and Range Searching) -- Simple Compression Code Supporting Random Access and Fast String Matching -- Engineering a Compressed Suffix Tree Implementation -- Simple Space-Time Trade-Offs for AESA -- Session 6 (Matching, Flows, and Spanners) -- Engineering Algorithms for Approximate Weighted Matching -- Experimental Evaluation of Parametric Max-Flow Algorithms -- Experimental Study of Geometric t-Spanners: A Running Time Comparison -- Session 7 (Covering, Coloring, and Partitioning) -- Vertex Cover Approximations on Random Graphs -- Optimal Edge Deletions for Signed Graph Balancing -- Algorithms for the Balanced Edge Partitioning Problem -- Session 8 (Applications) -- Experimental Evaluations of Algorithms for IP Table Minimization -- Algorithms for Longer OLED Lifetime -- Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data -- Session 9 (Spanning Trees) -- Benchmarks for Strictly Fundamental Cycle Bases -- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem -- Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights -- Session 10 (Packing and Auctions) -- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem -- Trunk Packing Revisited -- Exact Algorithms for the Matrix Bid Auction.
520 _aThis book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007. The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.
650 0 _aSoftware engineering.
_94138
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aComputer graphics.
_94088
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aComputer Graphics.
_94088
700 1 _aDemetrescu, Camil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9145431
710 2 _aSpringerLink (Online service)
_9145432
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540728443
776 0 8 _iPrinted edition:
_z9783540839002
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4525
_9145433
856 4 0 _uhttps://doi.org/10.1007/978-3-540-72845-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93648
_d93648