Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithms

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

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Paola Festa

    1. Department of Mathematics and Applications, University of Napoli Federico II, Napoli, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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)

Included in the following conference series:

Conference proceedings info: SEA 2010.

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (42 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Papers

    1. Experimental Study of Resilient Algorithms and Data Structures

      • Umberto Ferraro-Petrillo, Irene Finocchi, Giuseppe F. Italiano
      Pages 1-12

    2. Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs

      • Panos M. Pardalos, Steffen Rebennack
      Pages 13-22

  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. Contraction of Timetable Networks with Realistic Transfers

      • Robert Geisberger
      Pages 71-82

    6. Distributed Time-Dependent Contraction Hierarchies

      • Tim Kieritz, Dennis Luxen, Peter Sanders, Christian Vetter
      Pages 83-93

    7. Practical Compressed Suffix Trees

      • Rodrigo Cánovas, Gonzalo Navarro
      Pages 94-105

    8. Maximum Cliques in Protein Structure Comparison

      • Noël Malod-Dognin, Rumen Andonov, Nicola Yanev
      Pages 106-117

    9. Exact Bipartite Crossing Minimization under Tree Constraints

      • Frank Baumann, Christoph Buchheim, Frauke Liers
      Pages 118-128

    10. Bit-Parallel Search Algorithms for Long Patterns

      • Branislav ÄŽurian, Hannu Peltola, Leena Salmela, Jorma Tarhio
      Pages 129-140

    11. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

      • Chris Whidden, Robert G. Beiko, Norbert Zeh
      Pages 141-153

    12. Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars

      • Alain Hauser, Jens Maue
      Pages 154-165

    13. Time-Dependent Contraction Hierarchies and Approximation

      • Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, Peter Sanders
      Pages 166-177

    14. A New Combinational Logic Minimization Technique with Applications to Cryptology

      • Joan Boyar, René Peralta
      Pages 178-189

    15. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements

      • Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
      Pages 190-201

    16. 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

    17. An Approximate ε-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem

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

Other volumes

  1. Experimental Algorithms

Keywords

Editors and Affiliations

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

    Paola Festa

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation