This volume constitutes the refereed proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, held on Ischia Island, Naples, Italy, in May 2010. The 40 revised full papers presented together with two invited papers were carefully reviewed and selected from 73 submissions. The topics covered include algorithm engineering, algorithmic libraries, algorithmic mechanism design, analysis of algorithms, algorithms for memory hierarchies, approximation techniques, bioinformatics, branch and bound algorithms, combinatorial and irregular problems, combinatorial structures and graphs, communication networks, complex networks, computational geometry, computational learning theory, computational optimization, computer systems, cryptography and security, data streams, data structures, distributed and parallel algorithms, evaluation of algorithms for realistic environments, experimental techniques and statistics, graph drawing, heuristics for combinatorial optimization
Invited Papers
Experimental Study of Resilient Algorithms and Data Structures Umberto Ferraro-Petrillo Irene Finocchi Giuseppe F. Italiano 1
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs Panos M. Pardalos Steffen Rebennack 13
Contributed Regular Papers
Alternative Routes in Road Networks Ittai Abraham Daniel Delling Andrew V. Goldberg Renato F. Werneck 23
Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks Annabell Berger Martin Grimmer Matthias Müller-Hannemann 35
Space-Efficient SHARC-Routing Edith Brunel Daniel Delling Andreas Gemsa Dorothea Wagner 47
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation Serafino Cicerone Gianlorenzo D'Angelo Gabriele Di Stefano Daniele Frigioni Vinicio Maurizio 59
Contraction of Timetable Networks with Realistic Transfers Robert Geisberger 71
Distributed Time-Dependent Contraction Hierarchies Tim Kieritz Dennis Luxen Peter Sanders Christian Vetter 83
Practical Compressed Suffix Trees Rodrigo Cánovas Gonzalo Navarro 94
Maximum Cliques in Protein Structure Comparison Noël Malod-Dognin Rumen Andonov Nicola Yanev 106
Exact Bipartite Crossing Minimization under Tree Constraints Frank Baumann Christoph Buchheim Frauke Liers 118
Bit-Parallel Search Algorithms for Long Patterns Branislav Durian Hannu Peltola Leena Salmela Jorma Tarhio 129
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments (Extended Abstract) Chris Whidden Robert G. Beiko Norbert Zeh 141
Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars Alain Hauser Jens Maue 154
Time-Dependent Contraction Hierarchies and Approximation Gernot Veit Batz Robert Geisberger Sabine Neubauer Peter Sanders 166
A New Combinational Logic Minimization Technique with Applications to Cryptology Joan Boyar René Peralta 178
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements Benjamin Doerr Marvin Künnemann Magnus Wahlström 190
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm Hernán Abeledo Ricardo Fukasawa Artur Pessoa Eduardo Uchoa 202
An Approximate ε-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem Lucio Grandinetti Francesca Guerriero Demetrio Laganà Ornella Pisacane 214
A Branch-and-Price Algorithm for Multi-mode Resource Leveling Eamonn T. Coughlan Marco E. Lübbecke Jens Schulz 226
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs Gerald Gamrath Marco E. Lübbecke 239
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem Charles Delort Olivier Spanjaard 253
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation Edoardo Amaldi Stefano Coniglio Stefano Gualandi 266
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery Anand Subramanian Eduardo Uchoa Luiz Satoru Ochi 276
A Metaheuristic for a Two Echelon Location-routing Problem Maurizio Boccia Teodor G. Crainic Antonio Sforza Claudio Sterle 288
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint Minh Hoang Ha François Clautiaux Saïd Hanafi Christophe Wilbaut 302
An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem Daniela Ambrosino Davide Anghinolfi Massimo Paolucci Anna Sciomachen 314
An Analysis of Heuristics for Vertex Colouring Marco Chiarandini Thomas Stützle 326
Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-key Genetic Algorithm Paola Festa José F. Gonçalves Mauricio G.C. Resende Ricardo M.A. Silva 338
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs Claudia D'Ambrosio Antonio Frangioni Leo Liberti Andrea Lodi 350
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems Amotz Bar-Noy Panagiotis Cheilaris Yi Feng 361
Realtime Classification for Encrypted Traffic Roni Bar-Yanai Michael Langberg David Peleg Liam Roditty 373
Data Propagation with Guaranteed Delivery for Mobile Networks Hakob Aslanyan Pierre Leone Jose Rolim 386
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries Umberto Ferraro-Petrillo Fabrizio Grandoni Giuseppe F. Italiano 398
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure Md. Mostofa Ali Patwary Jean Blair Fredrik Manne 411
Policy-Based Benchmarking of Weak Heaps and Their Relatives Asger Bruun Stefan Edelkamp Jyrki Katajainen Jens Rasmussen 424
Modularity-Driven Clustering of Dynamic Graphs Robert Görke Pascal Maillard Christian Staudt Dorothea Wagner 436
Gateway Decompositions for Constrained Reachability Problems Bastian Katz Marcus Krug Andreas Lochbihler Ignaz Rutter Gregor Snelting Dorothea Wagner 449
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere Manuel Caroli Pedro M.M. de Castro Sébastien Loriot Olivier Rouiller Monique Teillaud Camille Wormser 462
Fault Recovery in Wireless Networks: The Geometric Recolouring Approach Henk Meijer Yurai Núñez-Rodríguez David Rappaport 474
Geometric Minimum Spanning Trees with GeoFilterKruskal Samidh Chatterjee Michael Connor Piyush Kumar 486
Practical Nearest Neighbor Search in the Plane Michael Connor Piyush Kumar 501
Author Index 513
Overview
This volume constitutes the refereed proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, held on Ischia Island, Naples, Italy, in May 2010. The 40 revised full papers presented together with two invited papers were carefully reviewed and selected from 73 submissions. The topics covered include algorithm engineering, algorithmic libraries, algorithmic mechanism design, analysis of algorithms, algorithms for memory hierarchies, approximation techniques, bioinformatics, branch and ...