Experimental Algorithms

6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007. Proceedings

Editors:

ISBN: 978-3-540-72844-3 (Print) 978-3-540-72845-0 (Online)

Table of contents (33 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-22

      An Alternative Ranking Problem for Search Engines

    2. No Access

      Book Chapter

      Pages 23-36

      Engineering Fast Route Planning Algorithms

    3. Book Chapter

      Pages 37-37

      Random Models for Geometric Graphs (Abstract)

  3. Session 1 (Route Planning)

    1. No Access

      Book Chapter

      Pages 38-51

      Better Landmarks Within Reach

    2. No Access

      Book Chapter

      Pages 52-65

      Landmark-Based Routing in Dynamic Graphs

    3. No Access

      Book Chapter

      Pages 66-79

      Dynamic Highway-Node Routing

  4. Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters)

    1. No Access

      Book Chapter

      Pages 80-93

      Dynamic Trees in Practice

    2. No Access

      Book Chapter

      Pages 94-107

      On the Cost of Persistence and Authentication in Skip Lists

    3. No Access

      Book Chapter

      Pages 108-121

      Cache-, Hash- and Space-Efficient Bloom Filters

  5. Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing)

    1. No Access

      Book Chapter

      Pages 122-135

      Crossing Minimization in Weighted Bipartite Graphs

    2. No Access

      Book Chapter

      Pages 136-149

      Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP

    3. No Access

      Book Chapter

      Pages 150-160

      A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

  6. Session 4 (Network Routing and Stability)

    1. No Access

      Book Chapter

      Pages 161-174

      Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks

    2. No Access

      Book Chapter

      Pages 175-188

      A Distributed Primal-Dual Heuristic for Steiner Problems in Networks

    3. No Access

      Book Chapter

      Pages 189-202

      An Experimental Study of Stability in Heterogeneous Networks

  7. Session 5 (Strings and Range Searching)

    1. No Access

      Book Chapter

      Pages 203-216

      Simple Compression Code Supporting Random Access and Fast String Matching

    2. No Access

      Book Chapter

      Pages 217-228

      Engineering a Compressed Suffix Tree Implementation

    3. No Access

      Book Chapter

      Pages 229-241

      Simple Space-Time Trade-Offs for AESA

  8. Session 6 (Matching, Flows, and Spanners)

    1. No Access

      Book Chapter

      Pages 242-255

      Engineering Algorithms for Approximate Weighted Matching

    2. No Access

      Book Chapter

      Pages 256-269

      Experimental Evaluation of Parametric Max-Flow Algorithms

previous Page of 2