SpringerLink
Log in

Algorithm Engineering

3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Jeffrey S. Vitter

    1. Department of Computer Science, Duke University, Durham, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Christos D. Zaroliagis

    1. Department of Computer Science, University of London, King’s College, London, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: WAE 1999.

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

Access this book

Log in via an institution
eBook EUR 42.79
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 53.49
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (27 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Invited Lectures

    1. Selecting Problems for Algorithm Evaluation

      • Andrew V. Goldberg
      Pages 1-11

    2. BSP Algorithms — “Write Once, Run Anywhere”

      • Bill McColl
      Pages 12-13

    3. Ten Years of LEDA: Some Thoughts

      • Kurt Mehlhorn
      Pages 14-14

  3. Contributed Papers

    1. Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison

      • VĂ­ctor M. JimĂ©nez, AndrĂ©s Marzal
      Pages 15-29

    2. Efficient Implementation of Lazy Suffix Trees

      • Robert Giegerich, Stefan Kurtz, Jens Stoye
      Pages 30-42

    3. Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism

      • Shlomit Dascal, Uzi Vishkin
      Pages 43-59

    4. Finding Minimum Congestion Spanning Trees

      • Renato Fonseca F. Werneck, JoĂŁo Carlos Setubal, Arlindo F. da Conceição
      Pages 60-71

    5. Evaluation of an Algorithm for the Transversal Hypergraph Problem

      • Dimitris J. Kavvadias, Elias C. Stavropoulos
      Pages 72-84

    6. Construction Heuristics and Domination Analysis for the Asymmetric TSP

      • Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich
      Pages 85-94

    7. Counting in Mobile Networks: Theory and Experimentation

      • K. Hatzis, G. Pentaris, P. Spirakis, B. Tampakas
      Pages 95-109

    8. Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport

      • Frank Schulz, Dorothea Wagner, Karsten Weihe
      Pages 110-123

    9. Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA

      • Panagiota Fatourou, Paul Spirakis, Panagiotis Zarafidis, Anna Zoura
      Pages 124-138

    10. On-Line Zone Construction in Arrangements of Lines in the Plane

      • Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
      Pages 139-153

    11. The Design and Implementation of Planar Maps in CGAL

      • Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan
      Pages 154-168

    12. An Easy to Use Implementation of Linear Perturbations within Cupgal

      • Jochen Comes, Mark Ziegelmann
      Pages 169-182

    13. Analysing Cache Effects in Distribution Sorting

      • Naila Rahman, Rajeev Raman
      Pages 183-197

    14. Fast Regular Expression Search

      • Gonzalo Navarro, Mathieu Raffinot
      Pages 198-212

    15. An Experimental Evaluation of Hybrid Data Structures for Searching

      • Maureen Korda, Rajeev Raman
      Pages 213-227

    16. LEDA-SM: Extending LEDA to Secondary Memory

      • Andreas Crauser, Kurt Mehlhorn
      Pages 228-242
Back to top

Other volumes

  1. Algorithm Engineering

Editors and Affiliations

  • Department of Computer Science, Duke University, Durham, USA

    Jeffrey S. Vitter

  • Department of Computer Science, University of London, King’s College, London, UK

    Christos D. Zaroliagis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation