Editors:
- 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)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
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.
Keywords
- computational geometry
- experimental algorithmics
- genetic algorithms
- theoretical foundations
- visualization
- benchmarking
- clustering
- constraint optimization
- data structures
- evolving networks
- GPU
- industrial production
- large-scale networks
- linear programming
- production systems
- real-time rendering
- route planning
- SAT solver
- streaming algorithms
- transportation networks
Editors and Affiliations
-
Kiel University , Kiel, Germany
Lasse Kliemann
-
Karlsruhe Institute of Technology , Karlsruhe, Germany
Peter Sanders
Bibliographic Information
Book Title: Algorithm Engineering
Book Subtitle: Selected Results and Surveys
Editors: Lasse Kliemann, Peter Sanders
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-49487-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2016
Softcover ISBN: 978-3-319-49486-9Published: 11 November 2016
eBook ISBN: 978-3-319-49487-6Published: 10 November 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 419
Number of Illustrations: 68 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Information Systems Applications (incl. Internet), Artificial Intelligence, Computer Communication Networks, Computation by Abstract Devices, Discrete Mathematics in Computer Science