FINDING MINIMUM-COST CIRCULATIONS BY CANCELING NEGATIVE CYCLES

被引:186
作者
GOLDBERG, AV
TARJAN, RE
机构
[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
[2] AT&T BELL LABS,MURRAY HILL,NJ 07974
[3] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
关键词
D O I
10.1145/76359.76368
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:873 / 886
页数:14
相关论文
共 35 条
[1]  
AHUJA RK, IN PRESS SIAM J COMP
[2]  
AHUJA RK, 1987, CSTR15488 PRINC U DE
[3]  
AHUJA RK, 1988, CSTR16488 PRINC U DE
[4]  
[Anonymous], 1970, SOVIET MATH DOKL
[5]   NOTE ON WEINTRAUB MINIMUM-COST CIRCULATION ALGORITHM [J].
BARAHONA, F ;
TARDOS, E .
SIAM JOURNAL ON COMPUTING, 1989, 18 (03) :579-583
[6]  
BERTSEKAS DP, 1986, LIDSP1986 MIT LAB DE
[7]  
BLAND RG, 1985, 661 CORN U SCH OP RE
[8]  
BOAS PV, 1977, MATH SYST THEORY, V10, P99
[9]  
Busacker R.G., 1965, FINITE GRAPHS NETWOR
[10]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&