Skip to main content
  • Conference proceedings
  • © 2010

Experimental Algorithms

9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings

Editors:

  • Fast-track conference proceedings

  • State-of-the-art research

  • Unique selling points

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6049)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SEA: International Symposium on Experimental Algorithms

Conference proceedings info: SEA 2010.

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (42 papers)

  1. Front Matter

  2. Invited Papers

    1. Experimental Study of Resilient Algorithms and Data Structures

      • Umberto Ferraro-Petrillo, Irene Finocchi, Giuseppe F. Italiano
      Pages 1-12
  3. Contributed Regular Papers

    1. Alternative Routes in Road Networks

      • Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
      Pages 23-34
    2. Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks

      • Annabell Berger, Martin Grimmer, Matthias Müller-Hannemann
      Pages 35-46
    3. Space-Efficient SHARC-Routing

      • Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner
      Pages 47-58
    4. 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
      Pages 59-70
    5. Distributed Time-Dependent Contraction Hierarchies

      • Tim Kieritz, Dennis Luxen, Peter Sanders, Christian Vetter
      Pages 83-93
    6. Practical Compressed Suffix Trees

      • Rodrigo Cánovas, Gonzalo Navarro
      Pages 94-105
    7. Maximum Cliques in Protein Structure Comparison

      • Noël Malod-Dognin, Rumen Andonov, Nicola Yanev
      Pages 106-117
    8. Exact Bipartite Crossing Minimization under Tree Constraints

      • Frank Baumann, Christoph Buchheim, Frauke Liers
      Pages 118-128
    9. Bit-Parallel Search Algorithms for Long Patterns

      • Branislav ÄŽurian, Hannu Peltola, Leena Salmela, Jorma Tarhio
      Pages 129-140
    10. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

      • Chris Whidden, Robert G. Beiko, Norbert Zeh
      Pages 141-153
    11. Time-Dependent Contraction Hierarchies and Approximation

      • Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders
      Pages 166-177
    12. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements

      • Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
      Pages 190-201
    13. The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm

      • Hernán Abeledo, Ricardo Fukasawa, Artur Pessoa, Eduardo Uchoa
      Pages 202-213
    14. An Approximate ε-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem

      • Lucio Grandinetti, Francesca Guerriero, Demetrio Laganà, Ornella Pisacane
      Pages 214-225

Other Volumes

  1. Experimental Algorithms

Keywords

  • ARC
  • algorithm engineering
  • algorithmic mechanism design
  • algorithms
  • analysis of algorithms
  • classification
  • combinatorial optimization
  • computational geometry
  • data structure
  • data structures
  • greedy randomized adaptive search procedure
  • machine learning
  • metaheuristic
  • sorting
  • telecommunications
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of Mathematics and Applications, University of Napoli Federico II, Napoli, Italy

    Paola Festa

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions