A good algorithm for lexicographically optimal flows in multi-terminal networks

DOI10.1090/S0002-9904-1977-14298-5zbMath0354.90083MaRDI QIDQ4126084

Nimrod Megiddo

Publication date: 1977

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Linear and combinatorial sharing problems, A solution to the random assignment problem on the full preference domain, Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems, Theory of Principal Partitions Revisited, Fair-by-design matching, On the solution of discrete bottleneck problems, Allocation rules on networks, Flow sharing and bankruptcy games, The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths, Fair welfare maximization, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on M-convex sets: algorithms and applications, An approximation algorithm for the facility location problem with lexicographic minimax objective, Optimal sharing, Algorithms and complexity analysis for some flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal flows in networks with multiple sources and sinks
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Network Flow and Testing Graph Connectivity
• Paths, Trees, and Flowers