Advertisement

Algorithm Engineering

Selected Results and Surveys

  • Lasse Kliemann
  • Peter Sanders

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9220)

Table of contents

  1. Front Matter
    Pages I-X
  2. Adrian Balint, Uwe Schöning
    Pages 1-18
  3. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders et al.
    Pages 19-80
  4. Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler
    Pages 81-116
  5. Aydın Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
    Pages 117-158
  6. Stefan Edelkamp
    Pages 185-225
  7. Matthias Fischer, Claudius Jähn, Friedhelm Meyer auf der Heide, Ralf Petring
    Pages 226-244
  8. Marc Goerigk, Anita Schöbel
    Pages 245-279
  9. Tanja Hartmann, Andrea Kappes, Dorothea Wagner
    Pages 280-329
  10. Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni
    Pages 379-417
  11. Back Matter
    Pages 419-419

About this book

Introduction

Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.

Keywords

computational geometry experimental algorithmics genetic algorithms theoretical foundations visualization benchmarking clustering constraint optimization data structures evolving networks GPU industrial production large-scale networks linear programming production systems real-time rendering route planning SAT solver streaming algorithms transportation networks

Editors and affiliations

  • Lasse Kliemann
    • 1
  • Peter Sanders
    • 2
  1. 1.Kiel University KielGermany
  2. 2.Karlsruhe Institute of Technology KarlsruheGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-49487-6
  • Copyright Information Springer International Publishing AG 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-49486-9
  • Online ISBN 978-3-319-49487-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site