Approximability of sparse integer programs

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

Volumn 5757 LNCS, Issue , 2009, Pages 83-94

  Pritchard, David ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; APPROXIMATION RATIOS; COVERING INTEGER PROGRAM; FEASIBLE SOLUTION; GREEDY METHOD; INTEGER PROGRAM; INTEGRAL SOLUTIONS; K-APPROXIMATION ALGORITHM; LP RELAXATION; PACKING INTEGER PROGRAMS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; UNIQUE GAMES CONJECTURE;

INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70350393403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_8     Document Type: Conference Paper

References (30)

1. Lenstra, H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538-548 (1983)
2. Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput. 34(5), 1129-1146 (2005); Preliminary version appeared in Proc. 35th STOC, pp. 595-601 (2003)
3. Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-l. J. Comput. Syst. Sci. 74(3), 335-349 (2008); Preliminary version appeared in Proc. 18th CCC, pp. 379-386 (2003)
4. Hochbaum, D.S.: Approximation algorithms for set covering and vertex cover problems. SIAM J. Comput. 11, 555-556 (1982)
5. Bar-Yehuda, R., Even, S.: A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2, 198-203 (1981)
6. Hall, N.G., Hochbaum, D.S.: A fast approximation algorithm for the multicovering problem. Discrete Appl. Math. 15(1), 35-40 (1986)
7. Hochbaum, D.S., Megiddo, N., Naor, J.S., Tamir, A.: Tight bounds and 2- approximation algorithms for integer programs with two variables per inequality. Math. Program. 62(1), 69-83 (1993)
8. Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint. Algorithmica 29(4), 595-609 (2001)
9. Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. 11th SODA, pp. 106-115 (2000)
10. Fujito, T., Yabuta, T.: Submodular integer cover and its application to production planning. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 154-166. Springer, Heidelberg (2005)
11. Koufogiannakis, C., Young, N.E.: Greedy degree-approximation algorithm for covering with arbitrary constraints and submodular cost. In: Albers, S., Marchetti- Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part I. LNCS, vol. 5555, pp. 634-652. Springer, Heidelberg (2009) arXiv:0807.0644
12. Pritchard, D.: Approximability of sparse integer programs (2009) arXiv:0904.0859
13. Shepherd, F.B., Vetta, A.: The demand-matching problem. Mathematics of Operations Research 32(3), 563-578 (2007); Preliminary version appeared in Proc. 9th IPCO, pp. 457-474, (2002)
14. Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree and packing integer programs. ACMTrans. Algorithms 3(3), 27 (2007); Preliminary version appeared in Proc. 30th ICALP, pp. 410-425 (2003)
15. Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. of Computing 7(3), 178-184 (2000); Preliminary version appeared in Proc. 7th SWAT, pp. 214-219 (2000)
16. Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discret. Math. 2(1), 68-72 (1989)
17. Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20-39 (2006); Preliminary versions appeared in Proc. 6th APPROX, pp. 83-97 (2003); ECCC-TR03-020 (2003)
18. Singh, M.: Iterative Methods in Combinatorial Optimization. PhD thesis, Carnegie Mellon University (2008)
19. Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput. 29(2), 648-670 (1999); Preliminary version appeared in Proc. 27th STOC, pp. 268-276 (1995)
20. Srinivasan, A.: An extension of the Lovász Local Lemma, and its applications to integer programming. SIAMJ. Comput. 36(3), 609-634 (2006); Preliminary version appeared in Proc. 7th SODA, pp. 6-15 (1996)
21. Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering/packing integer programs. J. Comput. Syst. Sci. 71(4), 495-505 (2005)
22. Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. 33rd STOC, pp. 453-461 (2001)
23. Hochbaum, D.S.: Monotonizing linear programs with up to two nonzeroes per column. Oper. Res. Lett. 32(1), 49-58 (2004)
24. Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. In: Proc. 49th FOCS, pp. 687-696 (2008)
25. Khot, S., Ponnuswami, A.K.: Better inapproximability results for maxClique, chromatic number and min-3Lin-deletion. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 226-237. Springer, Heidelberg (2006)
26. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
27. Magazine, M.J., Chern, M.S.: A note on approximation schemes for multidimensional knapsack problems. Math. of Oper. Research 9(2), 244-247 (1984)
28. Wolsey, L.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385-393 (1982)
29. Kolliopoulos, S.G., Stein, C.: Improved approximation algorithms for unsplittable flow problems. In: Proc. 38th FOCS, pp. 426-436 (1997)
30. Könemann, J., Parekh, O., Pritchard, D.: Max-weight integral multicommodity flow in spiders and high-capacity trees. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 1-14. Springer, Heidelberg (2009)