Experimental Algorithms 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30 - June 1, 2008 Proceedings

Experimental Algorithms 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30 - June 1, 2008 Proceedings / edited by Catherine C. McGeoch.

The Workshop on Experimental Algorithms, WEA, is intended to be an int- national forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: McGeoch, Catherine C. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edition:1st ed. 2008.
Series:Theoretical Computer Science and General Issues ; 5038
Springer eBook Collection.
Subjects:
Software engineering.
Computer programming.
Numerical analysis.
Algorithms.
Data structures (Computer science).
Computer science—Mathematics.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items