Experimental Algorithmics From Algorithm Design to Robust and Efficient Software /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Fleischer, Rudolf (Editor, http://id.loc.gov/vocabulary/relators/edt), Moret, Bernhard (Editor, http://id.loc.gov/vocabulary/relators/edt), Meineche Schmidt, Erik (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Edition: 1st ed. 2002.
• Series: Lecture Notes in Computer Science, 2547
• Subjects: Computer science.; Data structures (Computer science).; Algorithms.; Numerical analysis.; Computer science-Mathematics.; Computer Science, general.; Data Structures.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Discrete Mathematics in Computer Science.
• Physical Description: XVIII, 286 p. online resource.
• ISBN: 9783540363835
• ISSN: 0302-9743 ;
• DOI: 10.1007/3-540-36383-1

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.