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

DOI10.1090/S0002-9904-1977-14298-5zbMATH Open0354.90083MaRDI QIDQ4126084FDOQ4126084

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Paths, Trees, and Flowers
• Network Flow and Testing Graph Connectivity
• Title not available (Why is that?)
• Optimal flows in networks with multiple sources and sinks

Cited In (15)

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

This page was built for publication: A good algorithm for lexicographically optimal flows in multi-terminal networks

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