Advertisement

Algorithm Engineering

5th International Workshop, WAE 2001 Århus, Denmark, August 28–31, 2001 Proceedings

  • Gerth Stølting Brodal
  • Daniele Frigioni
  • Alberto Marchetti-Spaccamela
Conference proceedings WAE 2001

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Gonzalo Navarro, Mathieu Raffinot
    Pages 1-13
  3. Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon
    Pages 13-25
  4. Gianfranco Bilardi, Paolo D’Alberto, Alex Nicolau
    Pages 26-38
  5. Jyrki Katajainen, Bjarke Buur Mortensen
    Pages 39-50
  6. Naila Rahman, Richard Cole, Rajeev Raman
    Pages 67-78
  7. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
    Pages 79-90
  8. Arne Andersson, Per Carlsson, Fredrik Ygge
    Pages 91-105
  9. Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
    Pages 106-117
  10. Kazuo Iwama, Suguru Tamaki
    Pages 118-128
  11. David A. Bader, Ajith K. Illendula, Bernard M. E. Moret, Nina R. Weisse-Bernstein
    Pages 129-144
  12. Eric Anderson, Joe Hall, Jason Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia et al.
    Pages 145-158
  13. Ioannis Chatzigiannakis, Sotiris Nikoletseas, Nearchos Paspallis, Paul Spirakis, Christos Zaroliagis
    Pages 159-171
  14. Chris Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav Marathe et al.
    Pages 172-184
  15. Matthias Müller-Hannemann, Karsten Weihe
    Pages 185-197
  16. Back Matter
    Pages 199-199

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.

Keywords

algorithm engineering algorithms data structures discrete algorithms experimental algorithmics network algorithms optimization algorithms scheduling search algorithms shortest paths algorithms string matching

Editors and affiliations

  • Gerth Stølting Brodal
    • 1
  • Daniele Frigioni
    • 2
  • Alberto Marchetti-Spaccamela
    • 3
  1. 1.Department of Computer ScienceUniversity of Aarhus, BRICSÅarhusDenmark
  2. 2.Dipartimento di Ingegneria ElettricaUniversitá dell’AquilaL’AquilaItaly
  3. 3.Dipartimento di Informatica e SistemisticaUniversitá di Roma “La Sapienza”RomaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44688-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42500-7
  • Online ISBN 978-3-540-44688-0
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site