Faster Parametric Shortest Path and Minimum Balance Algorithms

Faster Parametric Shortest Path and Minimum Balance Algorithms (1991)

Cached

Download Links

[www.drenchedrock.net]

Other Repositories/Bibliography

DBLP

by Neal E. Young , Robert E. Tarjan , James B. Orlin

Venue:	NETWORKS
Citations:	41 - 2 self

BibTeX

@MISC{Young91fasterparametric,
    author = {Neal E. Young and Robert E. Tarjan and James B. Orlin},
    title = {Faster Parametric Shortest Path and Minimum Balance Algorithms},
    year = {1991}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
173	A characterization of the minimum cycle mean in a digraph - Karp - 1978
142	Graphs and algorithms - Gondran, Minoux - 1984
129	Amortized computational complexity - Tarjan - 1985
78	Applications of path compression on balanced trees - Tarjan - 1979
53	Finding minimum-cost circulations by cancelling negative cycles - Goldberg, Tarjan
43	New scaling algorithms for the assignment and minimum mean cycle problems - Orlin, Ahuja - 1992
33	J.B.: Parametric shortest path algorithms with an application to cyclic staffing - Karp, Orlin - 1981
8	Max-balancing weighted directed graphs and matrix scaling - Schneider, Schneider - 1991
2	A minimum concave cost dynamic network flow problem, with an application to lot sizing - Graves, Orlin - 1985
2	Computing optimal scalings by parametric network algorithms - Orlin, Rothblum - 1985
1	Towers and cycle covers for max-balanced graphs. Unpublished manuscript - Schneider, Schneider - 1989