Algorithm Engineering
Selected Results and Surveys
Editors: Kliemann, Lasse, Sanders, Peter (Eds.)
Free Preview- Written by experts
- High quality selected papers
- Unique visibility
Buy this book
- 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.
- About the authors
-
Lectures of the Reasoning Web Summer School
- Table of contents (12 chapters)
-
-
Engineering a Lightweight and Efficient Local Search SAT Solver
Pages 1-18
-
Route Planning in Transportation Networks
Pages 19-80
-
Theoretical Analysis of the k-Means Algorithm – A Survey
Pages 81-116
-
Recent Advances in Graph Partitioning
Pages 117-158
-
How to Generate Randomized Roundings with Dependencies and How to Derandomize Them
Pages 159-184
-
Table of contents (12 chapters)
- Download Preface 1 PDF (53.1 KB)
- Download Sample pages 2 PDF (1.1 MB)
- Download Table of contents PDF (56.3 KB)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Algorithm Engineering
- Book Subtitle
- Selected Results and Surveys
- Editors
-
- Lasse Kliemann
- Peter Sanders
- Series Title
- Theoretical Computer Science and General Issues
- Series Volume
- 9220
- Copyright
- 2016
- Publisher
- Springer International Publishing
- Copyright Holder
- Springer International Publishing AG
- eBook ISBN
- 978-3-319-49487-6
- DOI
- 10.1007/978-3-319-49487-6
- Softcover ISBN
- 978-3-319-49486-9
- Edition Number
- 1
- Number of Pages
- X, 419
- Number of Illustrations
- 68 b/w illustrations
- Topics
