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.The PTAS for the Maximum Subforest Problem due to Shamir and Tsur [3.48] has a running time of O(n22 1/Im a1). For a 20% ... Packing Problem due to Shachnai and Tamir [3.47] has a running time of O(n64/Im+(log(1/Im)/Im8)) (for three colors).
|Author||:||Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt|
|Publisher||:||Springer - 2003-07-01|