Experimental Algorithms
Springer International Publishing (Verlag)
978-3-319-07958-5 (ISBN)
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.
Selecting Data for Experiments: Past, Present and Future.- The Hospitals / Residents Problem with Couples: Complexity and Integer Programming Models.- Integral Simplex Using Decomposition with Primal Cuts.- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs.- Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.- An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.- Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.- Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.- Dynamic Windows Scheduling with Reallocation.- Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates.- Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest.- Retrieval and Perfect Hashing Using Fingerprinting.- Efficient Wavelet Tree Construction and Querying for Multicore Architectures.- Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket.- Loop Nesting Forests, Dominators, and Applications.- DenseZDD: A Compact and Fast Index for Families of Sets.- An Evaluation of Dynamic Labeling Schemes for Tree Networks.- Engineering Color Barcode Algorithms for Mobile Applications.- Computing Consensus Curves.- Evaluation of Labeling Strategies for Rotating Maps.- Experimental Comparison of Semantic Word Clouds.- Hub Labels: Theory and Practice.- Customizable Contraction Hierarchies.- Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.- Exploiting GPS Data in Public Transport Journey Planners.- Order-Preserving Matching with Filtration.- Approximate Online Matching of Circular Strings.- From Theory to Practice: Plug and Play with Succinct Data Structures.- Improved ESP-index: A Practical Self-index for Highly Repetitive Texts.- Partitioning Complex Networks via Size-ConstrainedClustering.- Tree-Based Coarsening and Partitioning of Complex Networks.- Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks.- Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study.- Efficient Representation for Online Suffix Tree Construction.- LCP Array Construction in External Memory.- Faster Compressed Suffix Trees for Repetitive Text Collections.- Improved and Extended Locating Functionality on Compressed Suffix Arrays.
| Erscheint lt. Verlag | 4.8.2014 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XX, 450 p. 126 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 718 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Algorithm Engineering • algorithmic libraries • approximation algorithms • combinatorial optimization • combinatorics • Computational Complexity • Computational Optimization • data structures • Discrete Mathematics • Discrete Structures • distributed algorithms • Geometry • graph algorithms analysis • Graph Drawing • Information Retrieval • Mathematical Optimization • Network Flows • Operations Research • Parallel Algorithms • parsing • paths and connectivity problems • Pattern Matching • Strings • suffix structures • Theory of Computation • Trees |
| ISBN-10 | 3-319-07958-1 / 3319079581 |
| ISBN-13 | 978-3-319-07958-5 / 9783319079585 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
