The power of local search: Maximum coverage over a matroid

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 601-612

  Filmus, Yuval ^a   Ward, Justin ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Approximation algorithms; Local search; Matroids; Maximum coverage

Indexed keywords

APPROXIMATION RATIOS; LINEAR OBJECTIVE FUNCTIONS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MAXIMUM COVERAGE; OBJECTIVE FUNCTIONS; PARTIAL ENUMERATIONS; SATISFIABILITY PROBLEMS;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; LEARNING ALGORITHMS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

COMBINATORIAL MATHEMATICS;

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

References (16)

1. Alexander A. Ageev and Maxim I. Sviridenko. Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. of Comb. Opt., 8: 17-30, 2004.
2. Paola Alimonti. New local search approximation techniques for maximum generalized satisfiability problems. In Algorithms and Complexity, volume 778 of LNCS, pages 40-53. Springer, 1994.
3. Richard A. Brualdi. Comments on bases in dependence structures. Bull. Austral. Math. Soc., 1: 161-167, 1969.
4. Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. In IPCO, 2007.
5. Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. In STOC, 2008.
6. Chandra Chekuri and Amit Kumar. Maximum coverage problem with group budget constraints and applications. In APPROX, pages 72-83, 2004.
7. Reuven Cohen and Liran Katzir. The generalized maximum coverage problem. Inf. Proc. Lett., 108(1): 15-22, 2008.
8. Gerard Cornuejols, Marshall L. Fisher, and George L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23(8): 789-810, April 1977.
9. Uriel Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4): 634-652, 1998.
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. Dorit S. Hochbaum and Anu Pathria. Analysis of the greedy approach in covering problems. Naval Research Quarterly, 45: 615-627, 1998.
12. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh V. Vazirani. On syntactic versus computational views of approximability. SIAM J. Comp., 28: 164-191, 1998.
13. Samir Khuller, Anna Moss, and Joseph (Seffi) Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70: 39-45, April 1999.
14. Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41: 960-981, September 1994.
15. Andreas S. Schulz, James B. Orlin, and Abraham P. Punnen. Approximate local search in combinatorial optimization. SIAM J. Comp., pages 587-596, 2004.
16. Aravind Srinivasan. Distributions on level-sets with applications to approximation algorithms. In FOCS, pages 588-599, 2001.