THE BOUNDED PATH TREE PROBLEM

被引：8

作者：

CAMERINI, PM ^{[1
]}

GALBIATI, G ^{[1
]}

机构：

[1] UNIV PAVIA,IST MATEMAT,I-27100 PAVIA,ITALY

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1982年 / 3卷 / 04期

关键词：

D O I：

10.1137/0603048

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：474 / 484

页数：11

共 10 条

[1] COMPLEXITY OF SPANNING TREE PROBLEMS .1. [J].

CAMERINI, PM ;

GALBIATI, G ;

MAFFIOLI, F .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (05) :346-352

[2]

Christofides N., 1975, GRAPH THEORY ALGORIT

[3] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

NETWORKS, 1979, 9 (03) :215-248

[4]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6] OPTIMUM LOCATIONS OF SWITCHING CENTERS + ABSOLUTE CENTERS + MEDIANS OF GRAPH [J].

HAKIMI, SL .

OPERATIONS RESEARCH, 1964, 12 (03) :450-&

[7]

HANDLER GY, 1979, LOCATION NETWORKS TH

[8]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

[9]

ROMANI F, 1981, COMMUNICATION

[10]

ROMANI F, 1980, INFORMATION PROCESSI, V11

← 1 →