Experimental Algorithms

Invited Lectures.- An Alternative Ranking Problem for Search Engines.- Engineering Fast Route Planning Algorithms.- Random Models for Geometric Graphs (Abstract).- Session 1 (Route Planning).- Better Landmarks Within Reach.- Landmark-Based Routing in Dynamic Graphs.- Dynamic Highway-Node Routing.- Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters).- Dynamic Trees in Practice.- On the Cost of Persistence and Authentication in Skip Lists.- Cache-, Hash- and Space-Efficient Bloom Filters.- Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing).- Crossing Minimization in Weighted Bipartite Graphs.- Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP.- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem.- Session 4 (Network Routing and Stability).- Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks.- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks.- An Experimental Study of Stability in Heterogeneous Networks.- Session 5 (Strings and Range Searching).- Simple Compression Code Supporting Random Access and Fast String Matching.- Engineering a Compressed Suffix Tree Implementation.- Simple Space-Time Trade-Offs for AESA.- Session 6 (Matching, Flows, and Spanners).- Engineering Algorithms for Approximate Weighted Matching.- Experimental Evaluation of Parametric Max-Flow Algorithms.- Experimental Study of Geometric t-Spanners: A Running Time Comparison.- Session 7 (Covering, Coloring, and Partitioning).- Vertex Cover Approximations on Random Graphs.- Optimal Edge Deletions for Signed Graph Balancing.- Algorithms for the Balanced Edge Partitioning Problem.- Session 8 (Applications).- Experimental Evaluations of Algorithms for IP Table Minimization.- Algorithms for Longer OLED Lifetime.- Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data.- Session 9 (Spanning Trees).- Benchmarks for Strictly Fundamental Cycle Bases.- A Primal