Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations

@article{Hochbaum2002SolvingIP,
  title={Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations},
  author={Dorit S. Hochbaum},
  journal={European Journal of Operational Research},
  year={2002},
  volume={140},
  pages={291-321}
}
We define a class of monotone integer programs with constraints that involve up to three variables each. A generic constraint in such integer program is of the form ax by6 zþ c, where a and b are nonnegative and the variable z appears only in that constraint. We devise an algorithm solving such problems in time polynomial in the length of the input and the range of variables U. The solution is obtained from a minimum cut on a graph with OðnUÞ nodes and OðmUÞ arcs where n is the number of… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 39 references

A cut based algorithm for the convex dual of the minimum cost network flow

  • R. K. Ahuja, D. S. Hochbaum, J. B. Orlin
  • 1999
Highly Influential
10 Excerpts

Approximating covering and packing problems: Set cover, vertex cover, independent set and related problems

  • D. S. Hochbaum
  • 1997
Highly Influential
10 Excerpts

Forest harvesting and minimum cuts

  • D. S. Hochbaum, A. Pathria
  • Journal of Computing
  • 1997
Highly Influential
9 Excerpts

Various notions of approximations : Good , better , best and more

  • D. S. Hochbaum
  • 1997
Highly Influential
9 Excerpts

Locating competitive new facilities in the presence of existing facilities

  • M. Ball
  • Computer Science,
  • 1992
Highly Influential
3 Excerpts

An efficient algorithm for image segmentation, Markov Random Fields and related problems

  • Rolim
  • Computer Science,
  • 2001

Similar Papers

Loading similar papers…