European Symposia on Algorithms

ESA Test-of-Time Award 2016

The ESA Test-of-Time Award (ESA ToTA) recognizes excellent papers in algorithms research that were published in the ESA proceedings 19-21 years ago and which are still influential and stimulating for the field today. In this second year in which the award is given, papers from ESA'95 to ESA'97 were considered.

The award committee selected the following paper for the ESA ToTA 2016. The paper stands out as a classic in the algorithms field and by its excellent citation record still relevant today.

From ESA 95-97:

Boris V. Cherkassky, Andrew V. Goldberg:
Negative-cycle detection algorithms
Proceedings ESA'96, also in: Mathematical Programming 85:2 (1999) 277-311

The paper by Cherkassky and Goldberg deals with the problem of finding a negative-length cycle in a network or proving that there is none. Algorithms for this are a combination of a shortest-path algorithm and a negative-cycle detection strategy. The authors analyse known algorithms and some new ones and determine the best combinations. Novel instance generators are used in this study. The paper is a model experimental paper in algorithms.

Award Committee: Kurt Mehlhorn (Saarbrucken), Mike Paterson (Warwick), and Jan van Leeuwen (Utrecht)

ESA Test-of-Time Award 2015

The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding papers in algorithms research that were published in the ESA proceedings 19-21 years ago and which are still influential and stimulating for the field today. Exceptionally, in this first year in which award is given, the ESA ToTA 2015 committee was asked to consider all qualifying papers from ESA 93-95 and ESA 94-96, respectively.

The award committee selected the following two papers for the ESA ToTA 2015. The papers stand out for their impact and wide use in the algorithms field, and for their excellent citation records up to the present day.

From ESA 93-95:

Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm
Proceedings ESA'94, also in: JACM 44:4 (1997) 585-591

The minimum cut problem in graphs is a basic problem in network analysis and is needed, for example, as the separation routine in branch-and-cut algorithms for the Traveling Salesman problem. Stoer and Wagner gave an elegant and efficient algorithm for the problem that avoids the computation of maximum flows, building upon previous work by Nagamochi and Ibaraki. The same algorithm was independently found by Frank. The algorithm continues to be taught because of its elegance and used because of its efficiency and ease of implementation.

From ESA 94-96:

Sudipto Guha, Samir Khuller:
Approximation Algorithms for Connected Dominating Sets
Proceedings ESA'96, also in: Algorithmica 20:4 (1998) 374-387

It is natural to require connectedness as an additional constraint for a dominating set, for example, in ad hoc wireless networks. Domination guarantees coverage and connectedness guarantees communication between the selected nodes. Guha and Khuller gave polynomial algorithms for a logarithmic-factor approximation to its solution. Under the usual assumptions, this is the best possible. Their much-cited work has stimulated similar research for connected variants of many other graph problems.

Award Committee: Jan van Leeuwen, Kurt Mehlhorn and Mike Paterson