Abstrakt
In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, posets and polytopes. Our method relies on a simple and versatile algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope conv(X), where X is a subset of {0,1}^n.
The algorithm uses as a black box any algorithm that solves a variant of the classical linear optimization problem min {w . x ; x is from X}, and the resulting delay, i.e., the running time per visited vertex on the Hamilton path, is only by a factor of log n larger than the running time of the optimization algorithm. When X encodes a particular class of combinatorial objects, then traversing the skeleton of the polytope conv(X) along a Hamilton path corresponds to listing the combinatorial objects by local change operations, i.e., we obtain Gray code listings.
As concrete results of our general framework, we obtain efficient algorithms for generating all (c-optimal) bases and independent sets in a matroid; (c-optimal) spanning trees, forests, matchings, maximum matchings, and c-optimal matchings in a general graph; vertex covers, minimum vertex covers, c-optimal vertex covers, stable sets, maximum stable sets and c-optimal stable sets in a bipartite graph; as well as antichains, maximum antichains, c-optimal antichains, and c-optimal ideals of a poset. Specifically, the delay and space required by these algorithms are polynomial in the size of the matroid ground set, graph, or poset, respectively.
Furthermore, all of these listings correspond to Hamilton paths on the corresponding combinatorial polytopes, namely the base polytope, matching polytope, vertex cover polytope, stable set polytope, chain polytope and order polytope, respectively. As another corollary from our framework, we obtain an O(t_LP log n) delay algorithm for the vertex enumeration problem on 0/1-polytopes {x is is from R^n l A x <= b}, where A is from R^{m x n} and b is from R^m, and t_LP is the time needed to solve the linear program min {w . x ; A x <= b}.
This improves upon the 25-year old O(t_LP n) delay algorithm due to Bussieck and Lübbecke.