Experimental Algorithms

1. Front Matter

   PDF

2. Invited Papers

   1. Automatic Decomposition and Branch-and-Price—A Status Report

      • Marco E. Lübbecke

      Pages 1-8

   2. Continuous Local Strategies for Robotic Formation Problems

      • Barbara Kempkes, Friedhelm Meyer auf der Heide

      Pages 9-17

   3. Engineering Graph Partitioning Algorithms

      • Vitaly Osipov, Peter Sanders, Christian Schulz

      Pages 18-26

3. Contributed Papers

   1. Space Efficient Modifications to Structator— A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns

      • Benjamin Albrecht, Volker Heun

      Pages 27-38

   2. Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs

      • Eric Angel, Romain Campigotto, Christian Laforest

      Pages 39-50

   3. How to Attack the NP-Complete Dag Realization Problem in Practice

      • Annabell Berger, Matthias Müller-Hannemann

      Pages 51-62

   4. New Results about Multi-band Uncertainty in Robust Optimization

      • Christina Büsing, Fabio D’Andreagiovanni

      Pages 63-74

   5. Compact Relaxations for Polynomial Programming Problems

      • Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine

      Pages 75-86

   6. Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal

      • Alberto Costa, Leo Liberti

      Pages 87-98

   7. On Computing the Diameter of Real-World Directed (Weighted) Graphs

      • Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino

      Pages 99-110

   8. Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications

      • Annalisa D’Andrea, Guido Proietti

      Pages 111-122

   9. Engineering a New Loop-Free Shortest Paths Routing Algorithm

      • Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni, Vinicio Maurizio

      Pages 123-134

   10. Fully Dynamic Maintenance of Arc-Flags in Road Networks

       • Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni, Camillo Vitale

       Pages 135-147

   11. A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs

       • Martin Dietzfelbinger, Hendrik Peilke, Michael Rink

       Pages 148-159

   12. Branch Mispredictions Don’t Affect Mergesort

       • Amr Elmasry, Jyrki Katajainen, Max Stenmark

       Pages 160-171

   13. A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms

       • Simone Faro, Thierry Lecroq

       Pages 172-183

   14. Algorithms for Subnetwork Mining in Heterogeneous Networks

       • Guillaume Fertin, Hafedh Mohamed Babou, Irena Rusu

       Pages 184-194

   15. Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs

       • Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni

       Pages 195-207

   16. Adaptive Distributed b-Matching in Overlays with Preferences

       • Giorgos Georgiadis, Marina Papatriantafilou

       Pages 208-223

This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications.

• compact data structures
• mathematical programming
• natural languages
• robust optimization
• string matching
• algorithm analysis and problem complexity

• CNRS - LaBRI - Université Bordeaux 1, Talence cedex, France

  Ralf Klasing

Policies and ethics