ENGLISH

Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software

By Erik Meineche Schmidt (eds.) , Rudolf Fleischer , Peter Sanders (auth.) , David A. Bader , Bernard M. E. Moret , Bernard Moret

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2002
ISBN
978-3-540-00346-5, 978-3-540-36383-5
DOI
10.1007/3-540-36383-1
Language
english
Format
PDF
Filesize
4 MB (3917559 bytes)
Series
Lecture Notes in Computer Science 2547
Edition
1
Pages
286\294
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Computer Sciencegeneral; Data Structures; Algorithm Analysis and P

Description

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.

Similar books