LEADER 05760nam 22007575 450 001 996465328703316 005 20230220232438.0 010 $a3-642-13193-X 024 7 $a10.1007/978-3-642-13193-6 035 $a(CKB)2670000000017279 035 $a(SSID)ssj0000446460 035 $a(PQKBManifestationID)11249935 035 $a(PQKBTitleCode)TC0000446460 035 $a(PQKBWorkID)10496101 035 $a(PQKB)10302963 035 $a(DE-He213)978-3-642-13193-6 035 $a(MiAaPQ)EBC3065241 035 $a(PPN)149073046 035 $a(EXLCZ)992670000000017279 100 $a20100427d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental Algorithms$b[electronic resource] $e9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings /$fedited by Paola Festa 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 514 p. 126 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6049 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13192-1 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem -- A Branch-and-Price Algorithm for Multi-mode Resource Leveling -- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs -- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem -- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation -- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery -- A Metaheuristic for a Two Echelon Location-Routing Problem -- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint -- An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem -- An Analysis of Heuristics for Vertex Colouring -- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm -- Experiments with a Feasibility Pump Approach for Nonconvex MINLPs -- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems -- Realtime Classification for Encrypted Traffic -- Data Propagation with Guaranteed Delivery for Mobile Networks -- Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries -- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure -- Policy-Based Benchmarking of Weak Heaps and Their Relatives, -- Modularity-Driven Clustering of Dynamic Graphs -- Gateway Decompositions for Constrained Reachability Problems -- Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -- Fault Recovery in Wireless Networks: The Geometric Recolouring Approach -- Geometric Minimum Spanning Trees with GeoFilterKruskal -- Practical Nearest Neighbor Search in the Plane. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6049 606 $aComputer programming 606 $aAlgorithms 606 $aArtificial intelligence 606 $aApplication software 606 $aComputer networks 606 $aInformation storage and retrieval systems 606 $aProgramming Techniques 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aComputer and Information Systems Applications 606 $aComputer Communication Networks 606 $aInformation Storage and Retrieval 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aApplication software. 615 0$aComputer networks. 615 0$aInformation storage and retrieval systems. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aComputer and Information Systems Applications. 615 24$aComputer Communication Networks. 615 24$aInformation Storage and Retrieval. 676 $a005.1 702 $aFesta$b Paola$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSEA 2010 906 $aBOOK 912 $a996465328703316 996 $aExperimental Algorithms$9772547 997 $aUNISA