LEDA: a Library of Efficient Algorithms

Keywords and Synonyms

LEDA platform for combinatorial and geometric computing      

Problem Definition

In the last forty years, there has been a tremendous progress in the field of computer algorithms, especially within the core area known as combinatorial algorithms. Combinatorial algorithms deal with objects such as lists, stacks, queues, sequences, dictionaries, trees, graphs, paths, points, segments, lines, convex hulls, etc, and constitute the basis for several application areas including network optimization, scheduling, transport optimization, CAD, VLSI design, and graphics. For over thirty years, asymptotic analysis has been the main model for designing and assessing the efficiency of combinatorial algorithms, leading to major algorithmic advances.

Despite so many breakthroughs, however, very little had been done (at least until 15 years ago) about the practical utility and assessment of this wealth of theoretical work. The main reason for this lack was the absence of a standard algor...