Algorithm Engineering, 1st ed. 2016 Selected Results and Surveys Theoretical Computer Science and General Issues Series

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.

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.

Written by experts

High quality selected papers

Unique visibility

Includes supplementary material: sn.pub/extras