An application of simultaneous diophantine approximation in combinatorial optimization
We present a preprocessing algorithm to make certain polynomial time algorithms strongly polynomial time. The running time of some of the known combinatorial optimization algorithms depends on the size of the objective functionw. Our preprocessing algorithm replacesw by an integral valued-w whose size is polynomially bounded in the size of the combinatorial structure and which yields the same set of optimal solutions asw.
As applications we show how existing polynomial time algorithms for finding the maximum weight clique in a perfect graph and for the minimum cost submodular flow problem can be made strongly polynomial.
Further we apply the preprocessing technique to make H. W. Lenstra’s and R. Kannan’s Integer Linear Programming algorithms run in polynomial space. This also reduces the number of arithmetic operations used.
The method relies on simultaneous Diophantine approximation.
AMS subject classification (1980)68 E 10
Unable to display preview. Download preview PDF.
- R. E. Bixby, O. M.-C. Marcotte andL. E. Trotter, Jr., Packing and covering with integral flows in integral supply-demand networks,Report No. 84327—OR, Institut für Ökonometrie und Operations Research, University Bonn, Bonn, West Germany.Google Scholar
- J. W. S. Cassels,An Introduction to the Theory of Numbers, Berlin, Heidelberg, New York, Springer, 1971.Google Scholar
- W. H. Cunningham andA. Frank, A primal dual algorithm for submodular flows,Mathematics of Operations Research.,10 (1985).Google Scholar
- Z. Galil andÉ. Tardos, AnO(n 2(m+n logn)·logn) minimum cost flow algorithm,in: Proc., 27th Annual Symposium on Foundations of Computer Science (1986), 1–9.Google Scholar
- M. Grötschel, L. Lovász andA. Schrijver,The ellipsoid method and combinatorial optimization, Springer Verlag,to appear.Google Scholar
- R. Kannan, Improved algorithms for integer programming and related lattice problems,in: Proc.,15 th Annual ACM Symposium on the Theory of Computing (1983), 193–206.Final version: Minkowski’s Convex Body Theorem and Integer Programming, Carnegie-Mellon University,Report No. 86–105.Google Scholar
- É. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs,Operations Research, (1986), No. 2Google Scholar