An analysis of the greedy algorithm for the submodular set covering problem |
| |
Authors: | L A Wolsey |
| |
Institution: | (1) Center for Operations Research and Econometrics, Université Catholique de Louvain, 1348 Louvain-la-Neuve, Belgium |
| |
Abstract: | We consider the problem: min \(\{ \mathop \Sigma \limits_{j \in s} f_j :z(S) = z(N),S \subseteqq N\} \) wherez is a nondecreasing submodular set function on a finite setN. Whenz is integer-valued andz(Ø)=0, it is shown that the value of a greedy heuristic solution never exceeds the optimal value by more than a factor \(H(\mathop {\max }\limits_j z(\{ j\} ))\) where \(H(d) = \sum\limits_{i = 1}^d {\frac{1}{i}} \) . This generalises earlier results of Dobson and others on the applications of the greedy algorithm to the integer covering problem: min {fy: Ay ≧b, y ε {0, 1}} wherea ij ,b i } ≧ 0 are integer, and also includes the problem of finding a minimum weight basis in a matroid. |
| |
Keywords: | 68 C 05 68 C 25 90 C 10 05 B 35 |
本文献已被 SpringerLink 等数据库收录! |
|