Algorithms for approximating the network design problem for potential-based flows are obtained by reducing it to constrained shortest path problems, along with matching hardness results.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximating the Network Design Problem for Potential-Based Flows
Algorithms for approximating the network design problem for potential-based flows are obtained by reducing it to constrained shortest path problems, along with matching hardness results.