ALGORITHMS FOR 2 BOTTLENECK OPTIMIZATION PROBLEMS

被引：130

作者：

GABOW, HN

TARJAN, RE

机构：

[1] UNIV COLORADO,NOAA,COOPERAT INST RES ENVIRONM SCI,DEPT COMP SCI,BOULDER,CO 80309

[2] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

[3] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

JOURNAL OF ALGORITHMS | 1988年 / 9卷 / 03期

关键词：

D O I：

10.1016/0196-6774(88)90031-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：411 / 417

页数：7

共 20 条

[1]

BHAT KVS, 1984, UNPUB 0 N 2 5 LOG 2

[2]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[3] MIN-MAX SPANNING TREE PROBLEM AND SOME EXTENSIONS [J].

CAMERINI, PM .

INFORMATION PROCESSING LETTERS, 1978, 7 (01) :10-14

[4]

Dijkstra E. W., 1959, NUMER MATH, P269, DOI DOI 10.1007/BF01386390

[5] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[6] FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS [J].

FREDMAN, ML ;

TARJAN, RE .

JOURNAL OF THE ACM, 1987, 34 (03) :596-615

[7]

Gabow H. N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P347, DOI 10.1109/SFCS.1984.715935

[8]

Gabow H. N., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P90, DOI 10.1109/SFCS.1985.3

[9] EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS [J].

GABOW, HN ;

GALIL, Z ;

SPENCER, T ;

TARJAN, RE .

COMBINATORICA, 1986, 6 (02) :109-122

[10]

GABOW HN, 1987, UNPUB

← 1 2 →