Algorithm Engineering

Bridging the Gap between Algorithm Theory and Practice

  • Matthias Müller-Hannemann
  • Stefan Schirra

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

Table of contents

  1. Front Matter
  2. Matthias Müller-Hannemann, Stefan Schirra
    Pages 1-15
  3. Markus Geyer, Benjamin Hiller, Sascha Meinert
    Pages 16-57
  4. Sabine Helwig, Falk Hüffner, Ivo Rössling, Maik Weinard
    Pages 58-126
  5. Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer
    Pages 127-193
  6. Deepak Ajwani, Henning Meyerhenke
    Pages 194-236
  7. Marc Mörig, Sven Scholz, Tobias Tscheuschner, Eric Berberich
    Pages 237-289
  8. Roman Dementiev, Johannes Singler
    Pages 290-324
  9. Eric Berberich, Matthias Hagen, Benjamin Hiller, Hannes Moser
    Pages 325-388
  10. Daniel Delling, Roberto Hoffmann, Maria Kandyba, Anna Schulze
    Pages 389-445
  11. Matthias Müller-Hannemann, Stefan Schirra
    Pages 446-453
  12. Back Matter

About this book

Introduction

Algorithms are essential building blocks of computer applications. However, advancements in computer hardware, which render traditional computer models more and more unrealistic, and an ever increasing demand for efficient solution to actual real world problems have led to a rising gap between classical algorithm theory and algorithmics in practice. The emerging discipline of Algorithm Engineering aims at bridging this gap. Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, robust and efficient implementations to careful experiments. This tutorial - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in September 2006 - covers the essential aspects of this process in ten chapters on basic ideas, modeling and design issues, analysis of algorithms, realistic computer models, implementation aspects and algorithmic software libraries, selected case studies, as well as challenges in Algorithm Engineering. Both researchers and practitioners in the field will find it useful as a state-of-the-art survey.

Keywords

ad-hoc networks algebraic modeling languages algorithm design algorithmics algorithms binary optimization calculus case studies computational geometry computational testing constraint programming correctness design distributed syst modeling

Editors and affiliations

  • Matthias Müller-Hannemann
    • 1
  • Stefan Schirra
    • 2
  1. 1.Institut für InformatikMartin-Luther-Universität Halle-WittenbergHalleGermany
  2. 2.Fakultät für InformatikOtto-von-Guericke Universität MagdeburgMagdeburgGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-14866-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-14865-1
  • Online ISBN 978-3-642-14866-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book