A (k + 3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 42-53

  Ward, Justin ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Approximation algorithms; K exchange systems; K set packing; Local search; Submodular maximization

Indexed keywords

A-MONOTONE; APPROXIMATION RATIOS; COMBINATORIAL OPTIMIZATION PROBLEMS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; PACKING PROBLEMS; SUBMODULAR; SUBMODULAR FUNCTIONS;

COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE;

APPROXIMATION ALGORITHMS;

EID: 84871995626     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.42     Document Type: Conference Paper

References (20)

1. E. M. Arkin and R. Hassin. On local search for weighted k-set packing. In Proc. of 5th ESA, pages 13-22, 1997.
2. P. Berman. A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. of Computing, 7: 178-184, Sept. 2000.
3. R. A. Brualdi. Induced matroids. Proc. of the American Math. Soc., 29: 213-221, 1971.
4. G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint. In Proc. of 12th IPCO, pages 182-196, 2007.
5. B. Chandra and M. Halldórsson. Greedy local improvement and weighted set packing approximation. In Proc. of 10th ACM-SIAM SODA, pages 169-176, 1999.
6. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45: 634-652, July 1998.
7. U. Feige, V. S. Mirrokni, and J. Vondrak. Maximizing non-monotone submodular functions. In Proc. of 48th IEEE FOCS, pages 461-471, 2007.
8. M. Feldman, J. S. Naor, and R. Schwartz. Nonmonotone submodular maximization via a structural continuous greedy algorithm. In Proc. of 38th ICALP, pages 342-353, 2011.
9. M. Feldman, J. S. Naor, R. Schwartz, and J. Ward. Improved approximations for k-exchange systems. In Proc. of 19th ESA, pages 784-798, 2011.
10. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions - II. In Polyhedral Combinatorics, volume 8 of Mathematical Programming Studies, pages 73-87. Springer Berlin Heidelberg, 1978.
11. S. O. Gharan and J. Vondrák. Submodular maximization by simulated annealing. In Proc. of 22nd ACM-SIAM SODA, pages 1098-1116, 2011.
12. A. Gupta, A. Roth, G. Schoenebeck, and K. Talwar. Constrained non-monotone submodu-lar maximization: Offline and secretary algorithms. In Proc. of 7th WINE, pages 246-257, 2010.
13. M. M. Halldórsson. Approximating discrete collections via local improvements. In Proc. of 6th ACM-SIAM SODA, pages 160-169, 1995.
14. E. Hazan, S. Safra, and O. Schwartz. On the complexity of approximating k-set packing. Computational Complexity, 15: 20-39, May 2006.
15. C. A. J. Hurkens and A. Schrijver. 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.
16. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proc. of 35th IEEE FOCS, pages 819-830, 1994.
17. J. Lee, V. S. Mirrokni, V. Nagarajan, and M. Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints. In Proc. of 41st ACM STOC, pages 323-332, 2009.
18. J. Lee, M. Sviridenko, and J. Vondrák. Matroid matching: the power of local search. In Proc. of 42nd ACM STOC, pages 369-378, 2010.
19. J. Lee, M. Sviridenko, and J. Vondrák. Submodular maximization over multiple matroids via generalized exchange properties. Math. of Oper. Res., 35(4): 795-806, Nov. 2010.
20. J. A. Soto. A simple PTAS for weighted matroid matching on strongly base orderable matroids. Electronic Notes in Discrete Mathematics, 37: 75-80, Aug. 2011.