Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown, MA, USA, May/June 2008 Proceedings: 7th International Workshop, WEA 2008 . (Lecture Notes in Computer Science)

Catherine C. McGeoch

ISBN 10: 3540685480 / ISBN 13: 9783540685487

Editore: Springer 2008-06-23, 2008

Riguardo questo articolo

Codice articolo 6666-IUK-9783540685487

Dati bibliografici

• Titolo: Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown, MA, USA, May/June 2008 Proceedings: 7th International Workshop, WEA 2008 . (Lecture Notes in Computer Science)
• Editore: Springer 2008-06-23
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540685480
• ISBN 13: 9783540685487
• Rilegatura: Paperback
• Condizione: New

Descrizione articolo

Riassunto

This book constitutes the refereed proceedings of the 7th International Workshop on Experimental and Efficient Algorithms, WEA 2008, held in Provincetown, MA, USA, in May/June 2008. The 26 revised full papers were carefully reviewed and selected from numerous submissions and present current research on experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. Special focus is put on the use of experimental methods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs.

Contenuti

Reducing Splaying by Taking Advantage of Working Sets.- Engineering Burstsort: Towards Fast In-Place String Sorting.- Comparing Integer Data Structures for 32 and 64 Bit Keys.- A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.- Layer-Free Upward Crossing Minimization.- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations.- Computing Branch Decomposition of Large Planar Graphs.- Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.- Computing Multiple Watchman Routes.- Engineering Parallel In-Place Random Generation of Integer Permutations.- Parallel Partition Revisited.- Broadword Implementation of Rank/Select Queries.- Efficient Implementations of Heuristics for Routing and Wavelength Assignment.- Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.- When to Reap and When to Sow – Lowering Peak Usage with Realistic Batteries.- Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design.- Fast Local Search for the Maximum Independent Set Problem.- Optimal University Course Timetables and the Partial Transversal Polytope.- A Basic Toolbox for Constrained Quadratic 0/1 Optimization.- Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory.- Reconstructing Phylogenetic Networks with One Recombination.- Exact Algorithms for Cluster Editing: Evaluation and Experiments.- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm.- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.- Bidirectional A ??? Search for Time-Dependent Fast Paths.- Multi-criteria Shortest Paths in Time-Dependent Train Networks.