ALCOMFT-TR-01-24

C. Demetrescu and G.F. Italiano
What Do We Learn from Experimental Algorithmics?
Rome. Work package 5. March 2001.

Abstract: Experimental Algorithmics is concerned with the design, implementation, tuning, debugging and performance analysis of computer programs for solving algorithmic problems. It provides methodologies and tools for designing, developing and experimentally analyzing efficient algorithmic codes and aims at integrating and reinforcing traditional theoretical approaches for the design and analysis of algorithms and data structures.

In this paper we survey some relevant contributions to the field of Experimental Algorithmics and we discuss significant examples where the experimental approach helped in developing new ideas, in assessing heuristics and techniques, and in gaining a deeper insight about existing algorithms.

Postscript file: ALCOMFT-TR-01-24.ps.gz (255 kb).