LEADER 04059nam 2200565 a 450 001 9910484330103321 005 20200520144314.0 010 $a3-540-34598-1 024 7 $a10.1007/11764298 035 $a(CKB)1000000000232997 035 $a(SSID)ssj0000317596 035 $a(PQKBManifestationID)11267311 035 $a(PQKBTitleCode)TC0000317596 035 $a(PQKBWorkID)10294468 035 $a(PQKB)11273762 035 $a(DE-He213)978-3-540-34598-5 035 $a(MiAaPQ)EBC3068155 035 $a(PPN)123135397 035 $a(EXLCZ)991000000000232997 100 $a20060420d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental algorithms $e5th international workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006 : proceedings /$fCarme Alvarez, Maria Serna (eds.) 205 $a1st ed. 2006. 210 $aBerlin ;$aNew York $cSpringer$dc2006 215 $a1 online resource (XII, 332 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v4007 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aEarlier conferences have title: Experimental and efficient algorithms. 311 $a3-540-34597-3 320 $aIncludes bibliographical references and index. 327 $aSession 1 -- Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation -- Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks -- Session 2 -- An Efficient Heuristic for the Ring Star Problem -- An Incremental Model for Combinatorial Maximization Problems -- Workload Balancing in Multi-stage Production Processes -- Session 3 -- Fault Cryptanalysis and the Shrinking Generator -- Some Advances in the Theory of Voting Systems Based on Experimental Algorithms -- Session 4 -- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces -- Fast and Simple Approximation of the Diameter and Radius of a Graph -- Session 5 -- Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference -- Lists Revisited: Cache Conscious STL Lists -- Engineering the LOUDS Succinct Tree Representation -- Session 6 -- Faster Adaptive Set Intersections for Text Searching -- Compressed Dictionaries: Space Measures, Data Sets, and Experiments -- Efficient Bit-Parallel Algorithms for (?,?)-Matching -- Session 7 -- Tiny Experiments for Algorithms and Life -- Evaluation of Online Strategies for Reordering Buffers -- Session 8 -- Scheduling Unrelated Parallel Machines Computational Results -- Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem -- Column Generation Based Heuristic for a Helicopter Routing Problem -- Session 9 -- Kernels for the Vertex Cover Problem on the Preferred Attachment Model -- Practical Partitioning-Based Methods for the Steiner Problem -- Session 10 -- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems -- A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification -- Session 11 -- Algorithmic Challenges in Web Search Engines -- On the Least Cost for Proximity Searching in Metric Spaces -- Session 12 -- Updating Directed Minimum Cost Spanning Trees -- Experiments on Exact Crossing Minimization Using Column Generation -- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. 410 0$aLecture notes in computer science ;$v4007. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aWEA 2006 606 $aComputer algorithms$vCongresses 615 0$aComputer algorithms 676 $a005.1 701 $aAlvarez$b Carme$01755646 701 $aSerna$b Maria$f1959-$01221274 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484330103321 996 $aExperimental algorithms$94192520 997 $aUNINA