Abstract
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of covering problems. In this paper, we study the approximability of CCIPs, in particular, their relation to the integrality gaps of the underlying 0,1-CIP.
If the underlying 0,1-CIP has an integrality gap O(γ), and assuming that the integrality gap of the priority version of the 0,1-CIP is O(ω), we give a factor O(γ + ω) approximation algorithm for the CCIP. Priority versions of 0,1-CIPs (PCIPs) naturally capture quality of service type constraints in a covering problem.
We investigate priority versions of the line (PLC) and the (rooted) tree cover (PTC) problems. Apart from being natural objects to study, these problems fall in a class of fundamental geometric covering problems. We bound the integrality of certain classes of this PCIP by a constant. Algorithmically, we give a polytime exact algorithm for PLC, show that the PTC problem is APX-hard, and give a factor 2-approximation algorithm for it.
Supported by NSERC grant no. 288340 and by an Early Research Award.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Balas, E.: Facets of the knapsack polytope. Math. Programming 8, 146–164 (1975)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069–1090 (2001)
Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 106–115 (2000)
Chakrabarty, D., Grant, E., Könemann, J.: On column-restricted and priority covering integer programs. arXiv eprint (2010)
Charikar, M., Naor, J., Schieber, B.: Resource optimization in qos multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. 12(2), 340–348 (2004)
Chekuri, C., Ene, A., Korula, N.: Unsplittable flow in paths and trees and column-restricted packing integer programs. In: Proceedings of International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2009) (to appear)
Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Alg. 3(3) (2007)
Chuzhoy, J., Gupta, A., Naor, J., Sinha, A.: On the approximability of some network design problems. ACM Trans. Alg. 4(2) (2008)
Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with non-negative data. Math. Oper. Res. 7(4), 515–531 (1982)
Hammer, P., Johnson, E., Peled, U.: Facets of regular 0-1 polytopes. Math. Programming 8, 179–206 (1975)
Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555–556 (1982)
Kolliopoulos, S.G.: Approximating covering integer programs with multiplicity constraints. Discrete Appl. Math. 129(2-3), 461–473 (2003)
Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing 31(3), 919–946 (2001)
Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using packing integer programs. Math. Programming 99(1), 63–87 (2004)
Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering/packing integer programs. J. Comput. System Sci. 71(4), 495–505 (2005)
Korula, N.: Private Communication (2009)
Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for (multi)set (multi)cover and covering integer programs. In: Proceedings of IEEE Symposium on Foundations of Computer Science (1993)
Schrijver, A.: Combinatorial optimization. Springer, New York (2003)
Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing 29(2), 648–670 (1999)
Srinivasan, A.: An extension of the lovász local lemma, and its applications to integer programming. SIAM Journal on Computing 36(3), 609–634 (2006)
Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of ACM Symposium on Theory of Computing, pp. 453–461 (2001)
Wolsey, L.: Facets for a linear inequality in 0-1 variables. Math. Programming 8, 168–175 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarty, D., Grant, E., Könemann, J. (2010). On Column-Restricted and Priority Covering Integer Programs. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)