Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software

by Rudolf Fleischer (Editor), Bernhard Moret (Editor), Erik Meineche Schmidt (Editor)

Overview

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.

Product Details

ISBN-13:	9783540003465
Publisher:	Springer Berlin Heidelberg
Publication date:	02/12/2003
Series:	Lecture Notes in Computer Science , #2547
Edition description:	2002
Pages:	286
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

Algorithm Engineering for Parallel Computation.- Visualization in Algorithm Engineering: Tools and Techniques.- Parameterized Complexity: The Main Ideas and Connections to Practical Computing.- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation.- Using Finite Experiments to Study Asymptotic Performance.- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms.- Algorithms and Heuristics in VLSI Design.- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics.- Presenting Data from Experiments in Algorithmics.- Distributed Algorithm Engineering.- Implementations and Experimental Studies of Dynamic Graph Algorithms.