Skip to main content
SpringerLink
Log in

Algorithm Engineering

Selected Results and Surveys

  • Book
  • © 2016

Overview

Editors:
  1. Lasse Kliemann

    1. Kiel University , Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Sanders

    1. Karlsruhe Institute of Technology , Karlsruhe, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Written by experts
  • High quality selected papers
  • Unique visibility
  • Includes supplementary material: sn.pub/extras

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Engineering a Lightweight and Efficient Local Search SAT Solver

    • Adrian Balint, Uwe Schöning
    Pages 1-18

  3. Route Planning in Transportation Networks

    • Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders et al.
    Pages 19-80

  4. Theoretical Analysis of the k-Means Algorithm – A Survey

    • Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler
    Pages 81-116

  5. Recent Advances in Graph Partitioning

    • Aydın Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
    Pages 117-158

  6. How to Generate Randomized Roundings with Dependencies and How to Derandomize Them

    • Benjamin Doerr, Magnus Wahlström
    Pages 159-184

  7. External-Memory State Space Search

    • Stefan Edelkamp
    Pages 185-225

  8. Algorithm Engineering Aspects of Real-Time Rendering Algorithms

    • Matthias Fischer, Claudius Jähn, Friedhelm Meyer auf der Heide, Ralf Petring
    Pages 226-244

  9. Algorithm Engineering in Robust Optimization

    • Marc Goerigk, Anita Schöbel
    Pages 245-279

  10. Clustering Evolving Networks

    • Tanja Hartmann, Andrea Kappes, Dorothea Wagner
    Pages 280-329

  11. Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications

    • Wiebke Höhn, Rolf H. Möhring
    Pages 330-351

  12. Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model

    • Lasse Kliemann
    Pages 352-378

  13. Engineering Art Galleries

    • Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni
    Pages 379-417

  14. Back Matter

    Pages 419-419
    Download chapter PDF
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Kiel University , Kiel, Germany

    Lasse Kliemann

  • Karlsruhe Institute of Technology , Karlsruhe, Germany

    Peter Sanders

About the editors

Lectures of the Reasoning Web Summer School

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation