Network design on undirected series-parallel graphs

DOI10.1007/978-3-031-60924-4_21MaRDI QIDQ7030716zbMATH OpenFDO

Authors Ishan Bansal, Ryan Mao, Avhan Misra

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-60924-4_21

zbMATH Keywords

approximation schemenetwork designpseudopolynomial algorithmseries-parallel graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• A network simplex method for the budget-constrained minimum cost flow problem
• Approximability of capacitated network design
• Budget-constrained minimum cost flows
• scientific article; zbMATH DE number 1487883 (Why is no real title available?)
• 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)