APPROXIMATION ALGORITHMS FOR THE SET COVERING AND VERTEX COVER PROBLEMS

被引：302

作者：

HOCHBAUM, DS

机构：

来源：

关键词：

D O I：

10.1137/0211045

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：555 / 556

页数：2

共 7 条

[1]

Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233

[2] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[3]

Galil Z., 1978, 19th Annual Symposium on Foundations of Computer Science, P231, DOI 10.1109/SFCS.1978.5

[4] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J].

JOHNSON, DS .

[5]

Karp R.M., 1972, COMPLEXITY COMPUTER

[6] VERTEX PACKINGS - STRUCTURAL-PROPERTIES AND ALGORITHMS [J].

NEMHAUSER, GL ;

TROTTER, LE .

[7]

PADBERG MW, 1980, 202 NEW YORK U GRAD