An application of simultaneous diophantine approximation in combinatorial optimization

@article{Frank1987AnAO,
  title={An application of simultaneous diophantine approximation in combinatorial optimization},
  author={A. Frank and {\'E}. Tardos},
  journal={Combinatorica},
  year={1987},
  volume={7},
  pages={49-65}
}
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… Expand
272 Citations
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
  • É. Tardos
  • Mathematics, Computer Science
  • Oper. Res.
  • 1986
  • 457
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
  • 162
  • PDF
STRONGLY POLYNOMIAL-TIME ALGORITHM FOR MINIMIZINGSUBMODULAR
  • Highly Influenced
Strongly Polynomial and Combinatorial Algorithms in Optimization
  • 3
  • PDF
Algorithmic aspects of some vertex ordering problems
  • PDF
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing
  • 6
  • PDF
Some new results on node-capacitated packing of A-paths
  • G. Pap
  • Mathematics, Computer Science
  • STOC '07
  • 2007
  • 16
  • PDF
Minkowski's Convex Body Theorem and Integer Programming
  • R. Kannan
  • Computer Science, Mathematics
  • Math. Oper. Res.
  • 1987
  • 662
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
  • É. Tardos
  • Mathematics, Computer Science
  • Oper. Res.
  • 1986
  • 457
Improved algorithms for integer programming and related lattice problems
  • R. Kannan
  • Mathematics, Computer Science
  • STOC '83
  • 1983
  • 435
  • Highly Influential
  • PDF
A Primal-Dual Algorithm for Submodular Flows
  • 64
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
  • 41
Testing membership in matroid polyhedra
  • W. Cunningham
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1984
  • 144
  • PDF
An O(n2(m + n log n) log n) min-cost flow algorithm
  • Z. Galil, É. Tardos
  • Mathematics, Computer Science
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
  • 23
Factoring polynomials with rational coefficients
  • 3,781
  • PDF
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  • 2,309
  • PDF
...
1
2
...