HEURISTICS FOR PLANAR MINIMUM-WEIGHT PERFECT MATCHINGS

被引:19
作者
IRI, M
MUROTA, K
MATSUI, S
机构
关键词
D O I
10.1002/net.3230130105
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:67 / 92
页数:26
相关论文
共 10 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]   LINEAR-TIME APPROXIMATION ALGORITHMS FOR FINDING THE MINIMUM-WEIGHT PERFECT MATCHING ON A PLANE [J].
IRI, M ;
MUROTA, K ;
MATSUI, S .
INFORMATION PROCESSING LETTERS, 1981, 12 (04) :206-209
[3]  
IRI M, 1980, SPR P C OP RES SOC J, P204
[4]  
IRI M, 1982, LECTURE NOTES CONTRO, V38, P572
[5]  
IRI M, 1981, RMI8107 U TOK DEP MA
[6]  
Lawler E.L., 1976, COMBINATORIAL OPTIMI
[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]   SUBADDITIVE EUCLIDEAN FUNCTIONALS AND NON-LINEAR GROWTH IN GEOMETRIC PROBABILITY [J].
STEELE, JM .
ANNALS OF PROBABILITY, 1981, 9 (03) :365-376
[10]  
SUPOWIT KJ, 1980, 12TH P ANN ACM S THE, P398