A note on submodular set cover on matroids

Discrete Mathematics

Volumn 309, Issue 18, 2009, Pages 5739-5744

  Gargano, Luisa ^a   Hammar, Mikael ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b Ideon Science Park   (Sweden)

Author keywords

Independent sets; Matroid; Set cover

Indexed keywords

MATRIX ALGEBRA; OPTIMIZATION;

INDEPENDENT SET; OPTIMIZATION PROBLEMS; POLYMATROIDS; RUNNING TIME; SET COVER; STRONGLY POLYNOMIALS; SUBMODULAR SET COVERS; SUBMODULAR SET FUNCTIONS;

COMBINATORIAL MATHEMATICS;

EID: 69549090242     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.05.019     Document Type: Article

References (17)

1. Ausiello G., Crescenzi P., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties (1999), Springer-Verlag
2. Bergmann G. Zur Axiomatik der Elementargeometrie. Monatschefte für Mathematik und Physik 36 (1929) 269-284
3. Birkhoff G. On the combination of subalgebras. Proceedings of the Cambridge Philosophical Society 29 (1933) 441-464
4. Edmonds J. Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and Their Applications (Proceedings Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, Alberta) (1970) pp. 69-87
5. M. Elkin, G. Kortsarz, Approximation algorithm for the directed telephone multicast problem, in: Proc. of ICALP, 2003
6. Fisher M.L., Nemhauser G.L., and Wolsey L.A. An analysis of approximations for maximizing submodular set functions-II. Mathematical Programming Study 8 (1978) 73-87
7. Frank A. An algorithm for submodular functions on graphs. J. of Algorithms 2 (1981) 328-336
8. Feige U. A threshold of ln n for approximating set cover. Journal of the ACM 45 4 (1998) 634-652
9. Fujishige S. Theory of submodular programs: Fenchel-type min-max theorem and subgradients of submodular functions. Mathematical Programming 29 (1984) 348-360
10. Fujito T. Approximation algorithms for submodular set cover with applications. IEICE Trans. Inf. & Syst. E83-D 3 (2000) 480-487
11. Gargano, L. , Rescigno, A.A. , Vaccaro, U."Multicasting to groups in optical networks and related combinatorial optimization problems" in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 2003, Article number 1213409
12. Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197
13. Lovàsz L. On the ratio of the optimal integral and fractional covers. Disc. Math. 13 (1975) 383-390
14. Lovàsz L. In: Bachem A., Grötschel M., and Korte B. (Eds). Submodular Functions and Convexity, Mathematical Programming - The State of the Art (1983), Springer, Berlin 235-257
15. Schrijver A. Combinatorial Optimization - Polyhedra and Efficiency (2003), Springer-Verlag
16. Wolsey L.A. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2 4 (1982) 385-393
17. Wolsey L.A. Maximizing real-valued submodular functions: Primal and dual heuristics for location problems. Mathematics of Operations Research 7 3 (1982) 410-425