EFFICIENT ALGORITHM FOR MINIMUM K-COVERS IN WEIGHTED GRAPHS

被引：11

作者：

WHITE, LJ ^{[1
]}

GILLENSON, ML ^{[1
]}

机构：

[1] OHIO STATE UNIV, COLUMBUS, OH 43210 USA

来源：

关键词：

D O I：

10.1007/BF01580426

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：20 / 42

页数：23

共 15 条

[1]

Balinski M, 1972, J COMBINATORIAL THEO, V13, P1

[2] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].

BALINSKI, ML .

[3]

BALINSKI ML, 1967, APR P C COMB MATH IT

[4] 2 THEOREMS IN GRAPH THEORY [J].

BERGE, C .

[5] COVERS AND PACKINGS IN A FAMILY OF SETS [J].

EDMONDS, J .

[6] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

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

[7] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[8]

EDMONDS J, 1970, COMBINATORIAL STRUCT, P89

EVERETT, H .

[10]

Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.2307/2033241, DOI 10.1090/S0002-9939-1956-0078686-7, 10.1090/S0002-9939-1956-0078686-7]