Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

This publication has 13 references indexed in Scilit:

• A bounded approximation for the minimum cost 2-sat problem
  Algorithmica, 1992
• Improved algorithms for linear inequalities with two variables per inequality
  Published by Association for Computing Machinery (ACM) ,1991
• Testing the necklace condition for shortest tours and optimal factors in the plane
  Theoretical Computer Science, 1989
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
  SIAM Journal on Computing, 1985
• Integer Programming with a Fixed Number of Variables
  Mathematics of Operations Research, 1983
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983
• Towards a Genuinely Polynomial Algorithm for Linear Programming
  SIAM Journal on Computing, 1983
• A Polynomial Algorithm for the Two-Variable Integer Programming Problem
  Journal of the ACM, 1980
• On the Complexity of Timetable and Multicommodity Flow Problems
  SIAM Journal on Computing, 1976
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972