A PARTITIONING ALGORITHM FOR MINIMUM WEIGHTED EUCLIDEAN MATCHING

被引：12

作者：

DYER, ME ^{[1
]}

FRIEZE, AM ^{[1
]}

机构：

[1] UNIV LONDON,QUEEN MARY COLL,DEPT COMP SCI & STAT,LONDON WC1E 7HU,ENGLAND

来源：

INFORMATION PROCESSING LETTERS | 1984年 / 18卷 / 02期

关键词：

D O I：

10.1016/0020-0190(84)90024-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：59 / 62

页数：4

共 13 条

[1] WORST CASE BOUNDS FOR THE EUCLIDEAN MATCHING PROBLEM [J].

AVIS, D .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (03) :251-257

[2]

AVIS D, 1982, SOCS824 MCG U REPT

[3] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

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

[4] 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-+

[5] A FAST ALGORITHM FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM, OPTIMAL WITH PROBABILITY ONE [J].

HALTON, JH ;

TERADA, R .

SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :28-46

[6]

Karp R. M., 1977, Mathematics of Operations Research, V2, P209, DOI 10.1287/moor.2.3.209

[7]

PAPADIMITRIOU CH, 1977, 15TH P ANN ALL C COM, P368

[8] ON A GREEDY HEURISTIC FOR COMPLETE MATCHING [J].

REINGOLD, EM ;

TARJAN, RE .

SIAM JOURNAL ON COMPUTING, 1981, 10 (04) :676-681

[9]

REINGOLD EM, UNPUB NETWORKS

[10] SUBADDITIVE EUCLIDEAN FUNCTIONALS AND NON-LINEAR GROWTH IN GEOMETRIC PROBABILITY [J].

STEELE, JM .

ANNALS OF PROBABILITY, 1981, 9 (03) :365-376

← 1 2 →