Amazon cover image
Image from Amazon.com

Algorithm engineering : selected results and surveys / Lasse Kliemann, Peter Sanders (eds.).

Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 9220. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham, Switzerland : Springer, 2016Description: 1 online resource (x, 419 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783319494876
  • 3319494872
  • 3319494864
  • 9783319494869
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 518/.1 23
LOC classification:
  • QA9.58
Online resources:
Contents:
Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm -- A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes author index.

Online resource; title from PDF title page (SpringerLink, viewed November 22, 2016).

Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm -- A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.

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.

Powered by Koha