Network design on undirected series-parallel graphs
From MaRDI portal
Cites work
- A network simplex method for the budget-constrained minimum cost flow problem
- Approximability of capacitated network design
- Budget-constrained minimum cost flows
- Flow improvement and network flows with fixed costs
- On budget-constrained flow improvement.
- On the complexity and approximability of budget-constrained minimum cost flows
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
This page was built for publication: Network design on undirected series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030716)