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

Corinna Cortes, Mehryar Mohri, Ashish Rastogi (auth.), Camil Demetrescu (eds.)3540728449, 9783540728443, 9783540728450

This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007.

The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.

---

Table of contents :

Content:
Front Matter….Pages –
An Alternative Ranking Problem for Search Engines….Pages 1-22
Engineering Fast Route Planning Algorithms….Pages 23-36
Random Models for Geometric Graphs (Abstract)….Pages 37-37
Better Landmarks Within Reach….Pages 38-51
Landmark-Based Routing in Dynamic Graphs….Pages 52-65
Dynamic Highway-Node Routing….Pages 66-79
Dynamic Trees in Practice….Pages 80-93
On the Cost of Persistence and Authentication in Skip Lists ….Pages 94-107
Cache-, Hash- and Space-Efficient Bloom Filters….Pages 108-121
Crossing Minimization in Weighted Bipartite Graphs….Pages 122-135
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP….Pages 136-149
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem….Pages 150-160
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks….Pages 161-174
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks….Pages 175-188
An Experimental Study of Stability in Heterogeneous Networks….Pages 189-202
Simple Compression Code Supporting Random Access and Fast String Matching….Pages 203-216
Engineering a Compressed Suffix Tree Implementation….Pages 217-228
Simple Space-Time Trade-Offs for AESA….Pages 229-241
Engineering Algorithms for Approximate Weighted Matching ….Pages 242-255
Experimental Evaluation of Parametric Max-Flow Algorithms….Pages 256-269
Experimental Study of Geometric t-Spanners: A Running Time Comparison….Pages 270-284
Vertex Cover Approximations on Random Graphs….Pages 285-296
Optimal Edge Deletions for Signed Graph Balancing ….Pages 297-310
Algorithms for the Balanced Edge Partitioning Problem….Pages 311-323
Experimental Evaluations of Algorithms for IP Table Minimization….Pages 324-337
Algorithms for Longer OLED Lifetime….Pages 338-351
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data….Pages 352-364
Benchmarks for Strictly Fundamental Cycle Bases….Pages 365-378
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem….Pages 379-392
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights….Pages 393-405
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem….Pages 406-419
Trunk Packing Revisited….Pages 420-432
Exact Algorithms for the Matrix Bid Auction….Pages 433-445
Back Matter….Pages –