Theoretical improvements in algorithmic efficiency for network flow problems

DOI10.1007/3-540-36478-1_4MaRDI QIDQ4414634zbMATH OpenFDO

Authors Jack Edmonds, Richard Karp

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2570/25700031.htm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Algorithms for maximum network flow
• scientific article; zbMATH DE number 3900543
• scientific article; zbMATH DE number 65738
• Faster Scaling Algorithms for Network Problems
• scientific article; zbMATH DE number 4204092

Cited in

(13)

• Optimal resolution sequence of problems modelled by directed graphs
• New algorithms for generalized network flows
• Improving the efficiency of the dynamic analysis of mass flow networks
• scientific article; zbMATH DE number 3896657 (Why is no real title available?)
• scientific article; zbMATH DE number 3900543 (Why is no real title available?)
• scientific article; zbMATH DE number 3904297 (Why is no real title available?)
• Common aspects of several network flow algorithms
• On Transportation Problems with Upper Bounds on Leading Rectangles
• An efficient algorithm for the transshipment along a single road problem
• An algorithm for labeling network flow problems
• Algorithm for a bottleneck optimization problem in data processing and data transmission systems
• Characterization of random walks on space of unordered trees using efficient metric simulation
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems

This page was built for publication: Theoretical improvements in algorithmic efficiency for network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414634)