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

来源：

JOURNAL OF THE ACM | 1989年 / 36卷 / 04期

关键词：

D O I：

10.1145/76359.76368

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：873 / 886

页数：14

共 35 条

[11]

Ford L., 1962, FLOWS NETWORKS

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

FREDMAN, ML ;

TARJAN, RE .

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

[13] A CAPACITY-ROUNDING ALGORITHM FOR THE MINIMUM-COST CIRCULATION PROBLEM - A DUAL FRAMEWORK OF THE TARDOS ALGORITHM [J].

FUJISHIGE, S .

MATHEMATICAL PROGRAMMING, 1986, 35 (03) :298-308

[14]

GABOW HN, IN PRESS SIAM J COMP

[15] AN O(N2(M+NLOGN)LOGN) MIN-COST FLOW ALGORITHM [J].

GALIL, Z ;

TARDOS, E .

JOURNAL OF THE ACM, 1988, 35 (02) :374-386

[16] A NEW APPROACH TO THE MAXIMUM-FLOW PROBLEM [J].

GOLDBERG, AV ;

TARJAN, RE .

JOURNAL OF THE ACM, 1988, 35 (04) :921-940

[17]

GOLDBERG AV, 1987, TR374 MIT LAB COMP S

[18]

GOLDBERG AV, 1987, 19TH P ACM S THEOR C, P7

[19]

GOLDBERG AV, IN PRESS MATH OPER R

[20]

KARP RM, 1978, DISCRETE MATH, V23, P309, DOI 10.1016/0012-365X(78)90011-0

← 1 2 3 4 →