, Volume 1, Issue 2, pp 169-197

The ellipsoid method and its consequences in combinatorial optimization

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is an adaptation of an algorithm proposed by Shor for non-linear optimization problems. In this paper we show that the method also yields interesting results in combinatorial optimization. Thus it yields polynomial algorithms for vertex packing in perfect graphs; for the matching and matroid intersection problems; for optimum covering of directed cuts of a digraph; for the minimum value of a submodular set function; and for other important combinatorial problems. On the negative side, it yields a proof that weighted fractional chromatic number is NP-hard.

Research by the third author was supported by the Netherlands Organisation for the Advancement of Pure Research (Z.W.O.).