Book Volume 5038 2008

Experimental Algorithms

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


ISBN: 978-3-540-68548-7 (Print) 978-3-540-68552-4 (Online)

Table of contents (26 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-13

    Reducing Splaying by Taking Advantage of Working Sets

  3. Chapter

    Pages 14-27

    Engineering Burstsort: Towards Fast In-Place String Sorting

  4. Chapter

    Pages 28-42

    Comparing Integer Data Structures for 32 and 64 Bit Keys

  5. Chapter

    Pages 43-54

    A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems

  6. Chapter

    Pages 55-68

    Layer-Free Upward Crossing Minimization

  7. Chapter

    Pages 69-86

    On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations

  8. Chapter

    Pages 87-100

    Computing Branch Decomposition of Large Planar Graphs

  9. Chapter

    Pages 101-113

    Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem

  10. Chapter

    Pages 114-128

    Computing Multiple Watchman Routes

  11. Chapter

    Pages 129-141

    Engineering Parallel In-Place Random Generation of Integer Permutations

  12. Chapter

    Pages 142-153

    Parallel Partition Revisited

  13. Chapter

    Pages 154-168

    Broadword Implementation of Rank/Select Queries

  14. Chapter

    Pages 169-180

    Efficient Implementations of Heuristics for Routing and Wavelength Assignment

  15. Chapter

    Pages 181-193

    Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games

  16. Chapter

    Pages 194-207

    When to Reap and When to Sow – Lowering Peak Usage with Realistic Batteries

  17. Chapter

    Pages 208-219

    Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design

  18. Chapter

    Pages 220-234

    Fast Local Search for the Maximum Independent Set Problem

  19. Chapter

    Pages 235-248

    Optimal University Course Timetables and the Partial Transversal Polytope

  20. Chapter

    Pages 249-262

    A Basic Toolbox for Constrained Quadratic 0/1 Optimization

  21. Chapter

    Pages 263-274

    Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory

previous Page of 2