LEADER 06105nam 22008895 450 001 996466259703316 005 20230221151539.0 010 $a1-280-94386-6 010 $a9786610943869 010 $a3-540-72845-7 024 7 $a10.1007/978-3-540-72845-0 035 $a(CKB)1000000000478512 035 $a(EBL)3061589 035 $a(SSID)ssj0000152044 035 $a(PQKBManifestationID)11161178 035 $a(PQKBTitleCode)TC0000152044 035 $a(PQKBWorkID)10339552 035 $a(PQKB)11621632 035 $a(DE-He213)978-3-540-72845-0 035 $a(MiAaPQ)EBC3061589 035 $a(MiAaPQ)EBC6711173 035 $a(Au-PeEL)EBL6711173 035 $a(OCoLC)184904602 035 $a(PPN)12316270X 035 $a(EXLCZ)991000000000478512 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental Algorithms$b[electronic resource] $e6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings /$fedited by Camil Demetrescu 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (457 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4525 300 $aDescription based upon print version of record. 311 $a3-540-72844-9 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4525 606 $aSoftware engineering 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aSoftware Engineering 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 14$aSoftware Engineering. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 676 $a005.1 702 $aDemetrescu$b Camil 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466259703316 996 $aExperimental Algorithms$9772547 997 $aUNISA