Generalized submodular cover problems and applications

The greedy approach has been successfully applied in the past to produce logarithmic ratio approximations to NP-hard problems under certain conditions. The problems for which these conditions hold are known as submodular cover problems. The current paper3extends the applicability of the greedy approach to wider classes of problems. The usefulness of our extensions is illustrated by giving new approximate solutions for two different types of problems. The first problem is that of finding the spanning tree of minimum weight among those whose diameter is bounded by D. A logarithmic ratio approximation algorithm is given for the cases of D=4 and 5. This approximation ratio is also proved to be the best possible, unless P=NP. The second type involves some (known and new) center selection problems, for which new logarithmic ratio approximation algorithms are given. Again, it is shown that the ratio must be at least logarithmic unless P=NP.

[1]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[2]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[3]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[4]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[5]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[6]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[7]  Dorit S. Hochbaum,et al.  Heuristics for the fixed cost median problem , 1982, Math. Program..

[8]  Shmuel Tomi Klein,et al.  Construction of optimal graphs for bit-vector compression , 1989, SIGIR '90.

[9]  Shmuel Tomi Klein,et al.  Compression of correlated bit-vectors , 1991, Inf. Syst..

[10]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[11]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[14]  Judit Bar-Ilan,et al.  How to Allocate Network Centers , 1993, J. Algorithms.

[15]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[16]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[17]  D. Peleg,et al.  Approximating shallow-light trees , 1997, SODA '97.

[18]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[19]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.