Experimental Algorithms : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 -- July 1, 2014, Proceedings

This book constitutes the refereed proceedings of the 13th International Symposium on Experimental Algorithms, SEA 2014, held in Copenhagen, Denmark, in June/July 2014. The 36 revised full papers presented together with 3 invited presentations were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on combinatorial optimization, data structures, graph drawing, shortest path, strings, graph algorithms and suffix structures. Front Matter....Pages - Selecting Data for Experiments: Past, Present and Future....Pages 1-9 The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models....Pages 10-21 Integral Simplex Using Decomposition with Primal Cuts....Pages 22-33 A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs....Pages 34-45 Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth....Pages 46-58 An Exact Algorithm for the Discrete Chromatic Art Gallery Problem....Pages 59-73 Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem....Pages 74-86 Relocation in Carsharing Systems Using Flows in Time-Expanded Networks....Pages 87-98 Dynamic Windows Scheduling with Reallocation ....Pages 99-110 Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates....Pages 111-122 Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest....Pages 123-137 Retrieval and Perfect Hashing Using Fingerprinting....Pages 138-149 Efficient Wavelet Tree Construction and Querying for Multicore Architectures....Pages 150-161 Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket....Pages 162-173 Loop Nesting Forests, Dominators, and Applications....Pages 174-186 DenseZDD: A Compact and Fast Index for Families of Sets....Pages 187-198 An Evaluation of Dynamic Labeling Schemes for Tree Networks....Pages 199-210 Engineering Color Barcode Algorithms for Mobile Applications....Pages 211-222 Computing Consensus Curves....Pages 223-234 Evaluation of Labeling Strategies for Rotating Maps....Pages 235-246 Experimental Comparison of Semantic Word Clouds....Pages 247-258 Hub Labels: Theory and Practice....Pages 259-270 Customizable Contraction Hierarchies....Pages 271-282 Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches....Pages 283-294 Exploiting GPS Data in Public Transport Journey Planners....Pages 295-306 Order-Preserving Matching with Filtration....Pages 307-314 Approximate Online Matching of Circular Strings....Pages 315-325 From Theory to Practice: Plug and Play with Succinct Data Structures....Pages 326-337 Improved ESP-index: A Practical Self-index for Highly Repetitive Texts....Pages 338-350 Partitioning Complex Networks via Size-Constrained Clustering....Pages 351-363 Tree-Based Coarsening and Partitioning of Complex Networks....Pages 364-375 Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks....Pages 376-387 Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study....Pages 388-399 Efficient Representation for Online Suffix Tree Construction....Pages 400-411 LCP Array Construction in External Memory....Pages 412-423 Faster Compressed Suffix Trees for Repetitive Text Collections....Pages 424-435 Improved and Extended Locating Functionality on Compressed Suffix Arrays....Pages 436-447 Erratum: Customizable Contraction Hierarchies....Pages E1-E1 Back Matter....Pages -