On column-restricted and priority covering integer programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6080 LNCS, Issue , 2010, Pages 355-368

  Chakrabarty, Deeparnab ^a   Grant, Elyot ^a   Könemann, Jochen ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; COVERING INTEGER PROGRAM; COVERING PROBLEMS; EXACT ALGORITHMS; INTEGRALITY GAPS; MATRIX; NATURAL OBJECTS; TREE COVER; TYPE CONSTRAINTS;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; PLATINUM COMPOUNDS; QUALITY OF SERVICE;

INTEGER PROGRAMMING;

EID: 77954392076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_27     Document Type: Conference Paper

References (22)

1. Balas, E.: Facets of the knapsack polytope. Math. Programming 8, 146-164 (1975)
2. 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)
3. 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)
4. Chakrabarty, D., Grant, E., Könemann, J.: On column-restricted and priority covering integer programs. arXiv eprint (2010)
5. 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)
6. 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)
7. Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Alg. 3(3) (2007)
8. Chuzhoy, J., Gupta, A., Naor, J., Sinha, A.: On the approximability of some network design problems. ACM Trans. Alg. 4(2) (2008)
9. Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with non-negative data. Math. Oper. Res. 7(4), 515-531 (1982)
10. Hammer, P., Johnson, E., Peled, U.: Facets of regular 0-1 polytopes. Math. Programming 8, 179-206 (1975)
11. Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11(3), 555-556 (1982)
12. Kolliopoulos, S.G.: Approximating covering integer programs with multiplicity constraints. Discrete Appl. Math. 129(2-3), 461-473 (2003)
13. Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing 31(3), 919-946 (2001)
14. Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using packing integer programs. Math. Programming 99(1), 63-87 (2004)
15. Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering/packing integer programs. J. Comput. System Sci. 71(4), 495-505 (2005)
16. Korula, N.: Private Communication (2009)
17. 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)
18. Schrijver, A.: Combinatorial optimization. Springer, New York (2003)
19. Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing 29(2), 648-670 (1999)
20. 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)
21. 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)
22. Wolsey, L.: Facets for a linear inequality in 0-1 variables. Math. Programming 8, 168-175 (1975)