Instant recognition of half integrality and 2-approximations

This publication has 11 references indexed in Scilit:

• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
  SIAM Journal on Computing, 1994
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
  Journal of Algorithms, 1994
• The Minimum Satisfiability Problem
  SIAM Journal on Discrete Mathematics, 1994
• Multiway cuts in directed and node weighted graphs
  Lecture Notes in Computer Science, 1994
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
  Operations Research, 1993
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
  Mathematical Programming, 1993
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
  Lecture Notes in Computer Science, 1993
• A new approach to the maximum-flow problem
  Journal of the ACM, 1988
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
  SIAM Journal on Computing, 1982