The minimum generalized vertex cover problem

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

Volumn 2832, Issue , 2003, Pages 289-300

  Hassin, Refael ^a   Levin, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EDGE COSTS; GENERALIZED VERTEX; MINIMUM COST; UNDIRECTED GRAPH;

COSTS;

EID: 0142214888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_28     Document Type: Article

References (7)

1. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", W.H. Freeman and Company, 1979.
2. D. S. Hochbaum, "Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations," European Journal of Operational Research, 140, 291-321, 2002.
3. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, and H. C. Wirth, "Improving minimum cost spanning trees by upgrading nodes", Journal of Algorithms, 33, 92-111, 1999.
4. E. L. Lawler, "Combinatorial Optimization: Networks and Matroids", Holt, Rinehart and Winston, 1976.
5. G. L. Nemhauser and L. E. Trotter, Jr., "Vertex packing: structural properties and algorithms", Mathematical Programming, 8, 232-248, 1975.
6. D. Paik, and S. Sahni, "Network upgrading problems", Networks, 26, 45-58, 1995.
7. M. Yannakakis, "Edge deletion problems", SIAM J. Computing, 10, 297-309, 1981.