On k-column sparse packing programs

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

Volumn 6080 LNCS, Issue , 2010, Pages 369-382

  Bansal, Nikhil ^a   Korula, Nitish ^b   Nagarajan, Viswanath ^a   Srinivasan, Aravind ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c University of Maryland   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; LP RELAXATION; PACKING CONSTRAINTS; PACKING INTEGER PROGRAMS; RANDOMIZED ROUNDING; SUBMODULAR FUNCTIONS; UPPER BOUND;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION;

INTEGER PROGRAMMING;

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

References (30)

1. Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley-Interscience, New York (2008)
2. Arkin, E.M., Hassin, R.: On Local Search for Weighted k-Set Packing. In: European Symposium on Algorithms, pp. 13-22 (1997)
3. Austrin, P., Khot, S., Safra, S.: Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. In: Comp. Complexity Conference (2009)
4. Bansal, N., Friggstad, Z., Khandekar, R., Salavatipour, M.R.: A logarithmic approximation for unsplittable flow on line graphs. In: SODA (2009)
5. Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: On k-Column Sparse Packing Programs (full version), arXiv (2010)
6. Baveja, A., Srinivasan, A.: Approximating Low-Congestion Routing and Column-Restricted Packing Problems. Information Proc. Letters (74), 19-25 (2000)
7. Baveja, A., Srinivasan, A.: Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Math. of Oper. Res. (25), 255-280 (2000)
8. Beck, J., Fiala, T.: "Integer making" theorems. Discrete Appl. Math. 3, 1-8 (1981)
9. Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic Journal of Computing 7(3), 178-184 (2000)
10. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function under a matroid constraint. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182-196. Springer, Heidelberg (2007)
11. Chakrabarty, D., Pritchard, D.: Personal Communication (2009)
12. Chandra, B., Halldórsson, M.: Greedy Local Improvement and Weighted Packing Approximation. In: SODA (1999)
13. Chekuri, C., Ene, A., Korula, N.: Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 42-55. Springer, Heidelberg (2009)
14. Chekuri, C., Ene, A., Korula, N.: Personal Communication (2009)
15. Chekuri, C., Mydlarz, M., Shepherd, B.: Multicommodity Demand Flow in a Tree and Packing Integer Programs. ACM Trans. on Algorithms 3(3) (2007)
16. Feige, U.: On maximizing welfare when utility functions are subadditive. In: STOC, pp. 41-50 (2006)
17. Halperin, E.: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs. SIAM J. Comput. 31(5), 1608-1623 (2002)
18. Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity 15(1), 20-39 (2003)
19. Hurkens, 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. Discrete Math. 2(1), 68-72 (1989)
20. Khot, S.: On the power of unique 2-prover 1-round games. In: STOC, pp. 767-775 (2002)
21. Kolliopoulos, S., Stein, C.: Approximating Disjoint-Path Problems using Packing Integer Programs. Mathematical Programming A (99), 63-87 (2004) (Pubitemid 40871732)
22. Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular functions subject to multiple linear constraints. In: SODA (2009)
23. Lee, J., Mirrokni, V., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization undermatroid and knapsack constraints. In:STOC, pp. 323-332 (2009)
24. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions II. Math. Prog. Study 8, 73-87 (1978)
25. Pritchard, D.: Approximability of Sparse Integer Programs. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 83-94. Springer, Heidelberg (2009)
26. Shepherd, B., Vetta, A.: The demand matching problem. Mathematics of Operations Research 32, 563-578 (2007)
27. Srinivasan, A.: Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM J. Comput. 29(2), 648-670 (1999)
28. Srinivasan, A.: New approaches to covering and packing problems. In: SODA, pp. 567-576 (2001)
29. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC, pp. 67-74 (2008)
30. Zuckerman, D.: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Theory of Computing 3(1), 103-128 (2007)