Experimental Algorithms

5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006. Proceedings

  • Carme Àlvarez
  • María Serna
Conference proceedings WEA 2006

DOI: 10.1007/11764298

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

Table of contents (29 papers)

  1. Front Matter
  2. Session 1

  3. Session 2

    1. An Efficient Heuristic for the Ring Star Problem
      Thayse Christine S. Dias, Gilberto F. de Sousa Filho, Elder M. Macambira, Lucidio dos Anjos F. Cabral, Marcia Helena C. Fampa
      Pages 24-35
    2. An Incremental Model for Combinatorial Maximization Problems
      Jeff Hartline, Alexa Sharp
      Pages 36-48
    3. Workload Balancing in Multi-stage Production Processes
      Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
      Pages 49-60
  4. Session 3

    1. Fault Cryptanalysis and the Shrinking Generator
      Marcin Gomułkiewicz, Mirosław Kutyłowski, Paweł Wlaź
      Pages 61-72
  5. Session 4

    1. Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
      Rodrigo Paredes, Edgar Chávez, Karina Figueroa, Gonzalo Navarro
      Pages 85-97
    2. Fast and Simple Approximation of the Diameter and Radius of a Graph
      Krists Boitmanis, Kārlis Freivalds, Pēteris Lediņš, Rūdolfs Opmanis
      Pages 98-108
  6. Session 5

    1. Lists Revisited: Cache Conscious STL Lists
      Leonor Frias, Jordi Petit, Salvador Roura
      Pages 121-133
    2. Engineering the LOUDS Succinct Tree Representation
      O’Neil Delpratt, Naila Rahman, Rajeev Raman
      Pages 134-145
  7. Session 6

    1. Faster Adaptive Set Intersections for Text Searching
      Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu
      Pages 146-157
    2. Compressed Dictionaries: Space Measures, Data Sets, and Experiments
      Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
      Pages 158-169
    3. Efficient Bit-Parallel Algorithms for (δ,α)-Matching
      Kimmo Fredriksson, Szymon Grabowski
      Pages 170-181
  8. Session 7

    1. Tiny Experiments for Algorithms and Life
      Jon Bentley
      Pages 182-182
    2. Evaluation of Online Strategies for Reordering Buffers
      Matthias Englert, Heiko Röglin, Matthias Westermann
      Pages 183-194
  9. Session 8

    1. Scheduling Unrelated Parallel Machines Computational Results
      Burkhard Monien, Andreas Woclaw
      Pages 195-206
    2. Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
      Mihhail Aizatulin, Florian Diedrich, Klaus Jansen
      Pages 207-218

About these proceedings

Keywords

Scheduling algorithmic mathematics algorithmics algorithms algorithms analysis algorithms design algorithms engineering algorithms implementation approximation algorithms combinatorial mathematics combinatorial optimization complexity computational discrete mathemati heuristics sorting

Editors and affiliations

  • Carme Àlvarez
    • 1
  • María Serna
    • 2
  1. 1.Software Department, Edifici OmegaUniversitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.ALBCOM Research GroupUniversitat Politècnica de Catalunya, Edifici ΩBarcelonaSpain

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-34597-8
  • Online ISBN 978-3-540-34598-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349