Abstract
In this thesis, we investigated the complexity and approximability of generalized network improvement and packing problems. In detail, we studied three extensions of the traditional maximum flow and minimum cost flow problem and revealed a strong connection to a novel variant of the bounded knapsack problem. For all of these problems, we both presented exact algorithms and investigated their approximability under involvement of a diverse set of graph classes.
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
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). Conclusion. In: Generalized Network Improvement and Packing Problems. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-16812-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-658-16812-4_8
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)