Skip to main content
  • Conference proceedings
  • © 2009

Experimental Algorithms

8th International Symposium SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings

Editors:

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

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

Buy it now

Buying options

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

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

Table of contents (26 papers)

  1. Front Matter

  2. Experimental Comparisons of Derivative Free Optimization Algorithms

    • A. Auger, N. Hansen, J. M. Perez Zerpa, R. Ros, M. Schoenauer
    Pages 3-15
  3. On Computational Models for Flash Memory Devices

    • Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz
    Pages 16-27
  4. Competitive Buffer Management with Stochastic Packet Arrivals

    • Kamal Al-Bawani, Alexander Souza
    Pages 28-39
  5. Fast and Accurate Bounds on Linear Programs

    • Ernst Althaus, Daniel Dumitriu
    Pages 40-50
  6. psort, Yet Another Fast Stable Sorting Software

    • Paolo Bertasi, Marco Bressan, Enoch Peserico
    Pages 76-88
  7. A Heuristic for Fair Correlation-Aware Resource Placement

    • Raouf Boutaba, Martin Karsten, Maxwell Young
    Pages 89-100
  8. Measuring the Similarity of Geometric Graphs

    • Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn
    Pages 101-112
  9. A Heuristic Strong Connectivity Algorithm for Large Graphs

    • Adan Cosgaya-Lozano, Norbert Zeh
    Pages 113-124
  10. Pareto Paths with SHARC

    • Daniel Delling, Dorothea Wagner
    Pages 125-136
  11. An Application of Self-organizing Data Structures to Compression

    • Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
    Pages 137-148
  12. Scheduling Additional Trains on Dense Corridors

    • Holger Flier, Thomas Graffagnino, Marc Nunkesser
    Pages 149-160
  13. Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games

    • Matthias Kirschner, Philipp Schengbier, Tobias Tscheuschner
    Pages 173-184
  14. Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow

    • Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia
    Pages 197-208

Other Volumes

  1. Experimental Algorithms

Editors and Affiliations

  • Fakultät für Informatik, Informatik XI, Technische Universität Dortmund, Dortmund, Germany

    Jan Vahrenhold

Bibliographic Information

Buy it now

Buying options

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