Computing the throughput of a network with dedicated lines

DOI10.1016/0166-218X(93)90050-XzbMath0780.90041OpenAlexW2094979605MaRDI QIDQ1803679

Paolo Serafini, Mihalis Yannakakis, Christos H. Papadimitriou

Publication date: 29 June 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90050-x

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (2)

Computing the throughput of a network with dedicated lines ⋮ One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs

Cites Work

• Unnamed Item
• Unnamed Item
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Computing the throughput of a network with dedicated lines
• Relationships between nondeterministic and deterministic tape complexities
• Two-Commodity Flow

This page was built for publication: Computing the throughput of a network with dedicated lines