The set cover with pairs problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 164-176

  Hassin, Refael ^a   Segev, Danny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

METRIC SPACES; NON-NEGATIVE COST; POINT SETS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 33744941093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_13     Document Type: Conference Paper

References (14)

1. V. Chvàtal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4:233-235, 1979.
2. E. J. Cockayne, S. E. Goodman, and S. T. Hedetniemi. A linear algorithm for the domination number of a tree. Information Processing Letters, 4:41-44, 1975.
3. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23:864-894, 1994.
4. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45:634-652, 1998.
5. U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29:410-421, 2001.
6. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997.
7. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20:374-387, 1998.
8. R. Hassin and D. Segev. The set cover with pairs problem, 2005. http://www.math.tau.ac.il/~segevd/Papers/SCP-Jour.pdf.
9. R. Hassin and A. Tamir. Improved complexity bounds for location problems on the real line. Operations Research Letters, 10:395-402, 1991.
10. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32:130-136, 1985.
11. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
12. F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46:787-832, 1999.
13. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
14. P. Slavík. Improved performance of the greedy algorithm for partial cover. Information Processing Letters, 64:251-254, 1997.