ON SHORTEST PATHS IN GRAPHS WITH RANDOM WEIGHTS

被引：46

作者：

HASSIN, R

ZEMEL, E

机构：

[1] NORTHWESTERN UNIV,GRAD SCH MANAGEMENT,EVANSTON,IL 60201

[2] TEL AVIV UNIV,LEON RECAMATI GRAD SCH BUSINESS ADM,IL-69978 TEL AVIV,ISRAEL

来源：

关键词：

D O I：

10.1287/moor.10.4.557

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：557 / 564

页数：8

共 29 条

[1]

BLONIARZ PA, 1983, SIAM J COMPUT, V13, P588

[2] THE DIAMETER OF RANDOM GRAPHS [J].

BOLLOBAS, B .

[3]

Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

CORNUEJOLS, G ;

NEMHAUSER, GL ;

WOLSEY, LA .

[5]

Erdos P., 1974, PROBABILISTIC METHOD

[6]

FISCHER ML, 1980, MATH OPER RES, V5, P27

[7]

Fredman M. L., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P338, DOI 10.1109/SFCS.1984.715934

[8]

HOCHBAUM DS, 1979, UNPUB PROBABILISTIC

[9]

Johnson D. B., 1975, Information Processing Letters, V4, P53, DOI 10.1016/0020-0190(75)90001-0

[10] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS [J].

JOHNSON, DB .