Abstract
We study the single pair capacitated network design problem and the budget constrained max flow problem on undirected series-parallel graphs. These problems were well studied on directed series-parallel graphs, but little is known in the context of undirected graphs. The major difference between the cases is that the source and sink of the problem instance do not necessarily coincide with the terminals of the underlying series-parallel graph in the undirected case, thus creating certain complications. We provide pseudopolynomial time algorithms to solve both of the problems and provide an FPTAS for the budget constrained max flow problem. We also provide some extensions, arguing important cases when the problems are polynomial-time solvable, and describing a series-parallel gadget that captures an edge upgrade version of the problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. Technical report, Sandia National Lab. (SNL-NM), Albuquerque, NM, USA; Sandia ... (1999)
Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of capacitated network design. Algorithmica 72, 493–514 (2015)
Holzhauser, M., Krumke, S.O., Thielen, C.: Budget-constrained minimum cost flows. J. Comb. Optim. 31(4), 1720–1745 (2016)
Holzhauser, M., Krumke, S.O., Thielen, C.: A network simplex method for the budget-constrained minimum cost flow problem. Eur. J. Oper. Res. 259(3), 864–872 (2017)
Holzhauser, M., Krumke, S.O., Thielen, C.: On the complexity and approximability of budget-constrained minimum cost flows. Inf. Process. Lett. 126, 24–29 (2017)
Krumke, S.O., Noltemeier, H., Schwarz, S., Wirth, H.C., Ravi, R.: Flow improvement and network flows with fixed costs. In: Kall, P., Lüthi, H.J. (eds.) Operations Research Proceedings 1998, vol. 1998, pp. 158–167. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-642-58409-1_15
Schwarz, S., Krumke, S.O.: On budget-constrained flow improvement. Inf. Process. Lett. 66(6), 291–297 (1998)
Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 1–12 (1979)
Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. 12(1), 57–74 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bansal, I., Mao, R., Misra, A. (2024). Network Design on Undirected Series-Parallel Graphs. In: Basu, A., Mahjoub, A.R., Salazar González, J.J. (eds) Combinatorial Optimization. ISCO 2024. Lecture Notes in Computer Science, vol 14594. Springer, Cham. https://doi.org/10.1007/978-3-031-60924-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-031-60924-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-60923-7
Online ISBN: 978-3-031-60924-4
eBook Packages: Computer ScienceComputer Science (R0)