Efficient algorithms for integer programs with two variables per constraint

Algorithmica (New York)

Volumn 29, Issue 4, 2001, Pages 595-609

  Bar Yehuda, R ^a   Rawitz, D ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

2SAT; Approximation algorithm; Combinatorial optimization; Integer programming; Local ratio technique; Vertex cover

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION;

ALGORITHMS;

EID: 0242269918     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010075     Document Type: Article

References (17)

1. B. Aspvall and Y. Shiloach. A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. SIAM Journal on Computing, 9:827-845, 1980.
2. R. Bar-Yehuda. One for the price of two: a unified approach for approximating covering problems. In Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 49-62, July 1998. Also in Algorithmica, 27:131-144, 2000.
3. R. Bar-Yehuda. One for the price of two: a unified approach for approximating covering problems. In Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 49-62, July 1998. Also in Algorithmica, 27:131-144, 2000.
4. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2:198-203, 1981.
5. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27-16, 1985.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
7. S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multi-commodity flow problems. SIAM Journal on Computing, 5(4):691-703, 1976.
8. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
9. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
10. D. Gusfield and L. Pitt. A bounded approximation for the minimum cost 2-SAT problem. Algorithmica, 8:103-117, 1992.
11. D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11(3):555-556, 1982.
12. D.S. Hochbaum, N. Megiddo, J. Naor, and A. Tamir. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Mathematical Programming, 62:69-83, 1993.
13. D. S. Hochbaum and J. Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23:1179-1192, 1994.
14. J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM Journal on Computing, 14:196-209, 1985.
15. G. L. Nemhauser and L. E. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
16. R. Shostak. Deciding linear inequalities by computing loop residues. Journal of the ACM, 28:769-779, 1981.
17. A. F. Veinott. Representation of general and polyhedral subsemilattices and sublattices of product spaces. Linear Algebra and its Applications, 114/115:681-704, 1989.