Abstract
We define a class of integer programs with constraints that involve up to three variables each. A generic constraint in such integer program is of the form ax + by ≤ z + c, where the variable z appears only in that constraint. For such binary integer programs it is possible to derive half integral superoptimal solutions in polynomial time. The scheme is also applicable with few modifications to nonbinary integer problems. For some of these problems it is possible to round the half integral solution to a 2-approximate solution. This extends the class of integer programs with at most two variables per constraint that were analyzed in [HMNT93]. The approximation algorithms here provide an improvement in running time and range of applicability compared to existing 2-approximations. Furthermore, we conclude that problems in the framework are MAX SNP-hard and at least as hard to approximate as vertex cover.
Problems that are amenable to the analysis provided here are easily recognized. The analysis itself is entirely technical and involves manipulating the constraints and transforming them to a totally unimodular system while losing no more than a factor of 2 in the integrality.
Research supported in part by NSF award No. DMI-9713482, and by SUN Microsystems.
Preview
Unable to display preview. Download preview PDF.
References
F. Chudak and D. S. Hochbaum. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Manuscript, UC Berkeley, (1997)
N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow in trees, with applications to matching and set cover. In Proceedings of the 20th International Colloquium on Automata, Languages and Programming, (1993)
N. Garg, V. V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Proceedings of the 21th International Colloquium on Automata, Languages and Programming, (1994) 487–498
A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. J. of ACM, 35 (1988) 921–940
J. Hao and J. B. Orlin. A faster algorithm for finding the minimum cut in a graph. Journal of Algorithms 17 (1994) 424–446
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 (1994) 1179–1192
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 (1993) 69–83
D. S. Hochbaum, A. Pathria. Approximating a Generalization of MAX 2SAT and MIN 2SAT. Manuscript, UC Berkeley, January (1997)
D. S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11 (1982) 555–556. An extended version in: W.P. #64-79-80, GSIA, Carnegie-Mellon University, April 1980
D. S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6 (1983) 243–254
D. S. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set and related problems. Chapter 3 in Approximation algorithms for NP-hard problems edited by D. S. Hochbaum. PWS Boston. (1996)
D. S. Hochbaum. Various notions of approximations: Good, Better, Best and more. Chapter 9 in Approximation algorithms for NP-hard problems edited by D. S. Hochbaum. PWS Boston. (1996)
D. S. Hochbaum. Approximating clique and biclique problems. Manuspcript, UC berkeley, June (1997). Revised Jan (1998)
D. S. Hochbaum. A framework for half integrality and good approximations. Manuspcript, UC berkeley, June 1996. Revised Sep (1997)
D. S. Hochbaum. The t-vertex cover problem: Extending the half integrality framework with budget constraints. UC berkeley, manuscript. February (1998). Extended abstract in this volume.
R. Kohli, R. Krishnamurti and P. Mirchandani. The minimum satisfiability problem. SIAM J. Discrete Mathematics, 7 (1994) 275–283
M. V. Marathe and S. S. Ravi. On approximation algorithms for the minimum satisfiability problem. Manuscript. Jan 1996. To appear Information Processing Letters.
J. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993) 338–350
B. Yu and J. Cheriyan. Approximation algorithms for feasible cut and multicut problems. Proc. Algorithms — ESA '95 P. Spirakis (ed.) LNCS 979, Springer, New York, (1995) 394–408
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hochbaum, D.S. (1998). Instant recognition of half integrality and 2-approximations. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053967
Download citation
DOI: https://doi.org/10.1007/BFb0053967
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64736-2
Online ISBN: 978-3-540-69067-2
eBook Packages: Springer Book Archive