Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithms

10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Panos M. Pardalos

    1. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Steffen Rebennack

    1. Division of Economics and Business, Colorado School of Mines, Golden, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • up-to-date results
  • fast track conference proceedings
  • state-of-the art report

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

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

Included in the following conference series:

Conference proceedings info: SEA 2011.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (38 papers)

  1. Front Matter

    Download chapter PDF

  2. Experimental Algorithms and Applications

    1. Invited Papers

      1. Approximability of Symmetric Bimatrix Games and Related Experiments
        • Spyros Kontogiannis, Paul Spirakis
        Pages 1-20
      2. Metaheuristic Optimization: Algorithm Analysis and Open Problems
        • Xin-She Yang
        Pages 21-32

    2. Contributed Papers

      1. Convexity and Optimization of Condense Discrete Functions
        • Emre Tokgöz, Sara Nourazari, Hillel Kumin
        Pages 33-42
      2. Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results
        • André Berger, Heiko Röglin, Ruben van der Zwaan
        Pages 43-53
      3. Hierarchical Delaunay Triangulation for Meshing
        • Shu Ye, Karen Daniels
        Pages 54-64
      4. A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem
        • Weiqi Li
        Pages 65-75
      5. Online Dictionary Matching with Variable-Length Gaps
        • Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
        Pages 76-87
      6. Dynamic Arc-Flags in Road Networks
        • Gianlorenzo D’Angelo, Daniele Frigioni, Camillo Vitale
        Pages 88-99
      7. Efficient Routing in Road Networks with Turn Costs
        • Robert Geisberger, Christian Vetter
        Pages 100-111
      8. On Minimum Changeover Cost Arborescences
        • Giulia Galbiati, Stefano Gualandi, Francesco Maffioli
        Pages 112-123
      9. Localizing Program Logical Errors Using Extraction of Knowledge from Invariants
        • Mojtaba Daryabari, Behrouz Minaei-Bidgoli, Hamid Parvin
        Pages 124-135
      10. Compressed String Dictionaries
        • Nieves R. Brisaboa, Rodrigo Cánovas, Francisco Claude, Miguel A. Martínez-Prieto, Gonzalo Navarro
        Pages 136-147
      11. Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic Algorithm
        • Christos Koukouvinos, Dimitris E. Simos
        Pages 148-156
      12. Improved Automated Reaction Mapping
        • Tina Kouri, Dinesh Mehta
        Pages 157-168
      13. An Experimental Evaluation of Incremental and Hierarchical <i>k</i>-Median Algorithms
        • Chandrashekhar Nagarajan, David P. Williamson
        Pages 169-180
      14. Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem
        • Marc Goerigk, Anita Schöbel
        Pages 181-192
      15. Practical Compressed Document Retrieval
        • Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela
        Pages 193-205
      16. Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems
        • Antonio Mucherino, Carlile Lavor, Therese Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan
        Pages 206-217
      17. An Experimental Evaluation of Treewidth at Most Four Reductions
        • Alexander Hein, Arie M. C. A. Koster
        Pages 218-229
Back to top

Other volumes

  1. Experimental Algorithms

Keywords

About this book

This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 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.

Editors and Affiliations

  • Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    Panos M. Pardalos

  • Division of Economics and Business, Colorado School of Mines, Golden, USA

    Steffen Rebennack

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation