Abstract
In this chapter, we give insights into the structural properties and the complexity of an extension of the generalized maximum flow problem in which the outflow of an edge is a strictly increasing convex function of its inflow. In contrast to the traditional generalized maximum flow problem, which is solvable in polynomial time as shown in Section 2.4, we show that the problem becomes NP-hard to solve and approximate in this novel setting. Nevertheless, we show that a flow decomposition similar to the one for traditional generalized flows is possible and present (exponential-time) exact algorithms for computing optimal flows on acyclic, series-parallel, and extension-parallel graphs as well as optimal preflows on general graphs. We also identify a polynomially solvable special case and show that the problem is solvable in pseudo-polynomial time when restricting to integral flows on series-parallel graphs.
This chapter is based on joint work with Sven O. Krumke and Clemens Thielen (Holzhauser et al., 2015b).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer Fachmedien Wiesbaden GmbH
About this chapter
Cite this chapter
Holzhauser, M. (2016). Convex Generalized Flows. In: Generalized Network Improvement and Packing Problems. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-16812-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-658-16812-4_7
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-16811-7
Online ISBN: 978-3-658-16812-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)