Efficient Algorithms

Beschreibung

This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable.

The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by Teubner-Verlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then.

The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness.

Autor*in

Susanne Albers

Themen in »Efficient Algorithms«

algorithms boolean networks combinatorial optimization complexity computational biology computational geometry energy saving geometric algorithms golomb rulers knowledge discovery kolmogorov-complexity optimization satisfiability search trees shortest paths

Stimmen zu »Efficient Algorithms«

Details

Link teilen