Computing the throughput of a network with dedicated lines

DOI10.1016/0166-218X(93)90050-XzbMATH Open0780.90041OpenAlexW2094979605MaRDI QIDQ1803679FDOQ1803679

Paolo Serafini, Mihalis Yannakakis, Christos 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

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

Cites Work

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

Cited In (3)

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

Recommendations

• Fast data transmission and maximal dynamic flow. 👍 👎
• Scheduling time-constrained communication in linear networks 👍 👎
• Computing the throughput of dynamic networks 👍 👎
• On the computation of fast data transmissions in networks with capacities and delays 👍 👎
• Transmissions in a network with capacities and delays 👍 👎

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

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