Skip to main content
Conference Proceedings

Theoretical improvements in algorithmic efficiency for network flow problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2570 31-33
DOI: 10.1007/3-540-36478-1_4
10Citations
Citations of this article
145Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum-cost flow problem. Upper bounds on the number of steps in these algorithms are derived, and are shown to improve on the upper bounds of earlier algorithms.

Cite

CITATION STYLE

APA

Edmonds, J., & Karp, R. M. (2003). Theoretical improvements in algorithmic efficiency for network flow problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2570, pp. 31–33). Springer Verlag. https://doi.org/10.1007/3-540-36478-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free