An application of simultaneous diophantine approximation in combinatorial optimization

A. Frank, Éva Tardos

Research output: Contribution to journalArticle

132 Citations (Scopus)

Abstract

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 function w. Our preprocessing algorithm replaces w 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 as w. 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.

Original languageEnglish
Pages (from-to)49-65
Number of pages17
JournalCombinatorica
Volume7
Issue number1
DOIs
Publication statusPublished - Mar 1987

Fingerprint

Diophantine Approximation
Simultaneous Approximation
Combinatorial optimization
Combinatorial Optimization
Preprocessing
Polynomial-time Algorithm
Polynomials
Combinatorial Algorithms
Polynomial
Perfect Graphs
Integer Linear Programming
Clique
Optimization Algorithm
Polynomial time
Objective function
Optimal Solution
Costs
Linear programming

Keywords

  • AMS subject classification (1980): 68E10

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)
  • Computational Mathematics

Cite this

An application of simultaneous diophantine approximation in combinatorial optimization. / Frank, A.; Tardos, Éva.

In: Combinatorica, Vol. 7, No. 1, 03.1987, p. 49-65.

Research output: Contribution to journalArticle

@article{13d0ea022e974e8fa62c357ac1946e55,
title = "An application of simultaneous diophantine approximation in combinatorial optimization",
abstract = "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 function w. Our preprocessing algorithm replaces w 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 as w. 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.",
keywords = "AMS subject classification (1980): 68E10",
author = "A. Frank and {\'E}va Tardos",
year = "1987",
month = "3",
doi = "10.1007/BF02579200",
language = "English",
volume = "7",
pages = "49--65",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "1",

}

TY - JOUR

T1 - An application of simultaneous diophantine approximation in combinatorial optimization

AU - Frank, A.

AU - Tardos, Éva

PY - 1987/3

Y1 - 1987/3

N2 - 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 function w. Our preprocessing algorithm replaces w 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 as w. 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.

AB - 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 function w. Our preprocessing algorithm replaces w 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 as w. 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.

KW - AMS subject classification (1980): 68E10

UR - http://www.scopus.com/inward/record.url?scp=51249175909&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249175909&partnerID=8YFLogxK

U2 - 10.1007/BF02579200

DO - 10.1007/BF02579200

M3 - Article

VL - 7

SP - 49

EP - 65

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -