Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2547)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (11 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications.
Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.
Editors and Affiliations
Bibliographic Information
Book Title: Experimental Algorithmics
Book Subtitle: From Algorithm Design to Robust and Efficient Software
Editors: Rudolf Fleischer, Bernard Moret, Erik Meineche Schmidt
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-36383-1
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Softcover ISBN: 978-3-540-00346-5Published: 13 December 2002
eBook ISBN: 978-3-540-36383-5Published: 01 July 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XVIII, 286
Topics: Computer Science, general, Data Structures, Algorithm Analysis and Problem Complexity, Numeric Computing, Discrete Mathematics in Computer Science, Algorithms