Buy print copy
About this book
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.
Similar content being viewed by others
Keywords
Table of contents (8 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
About the author
Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.
Bibliographic Information
Book Title: Generalized Network Improvement and Packing Problems
Authors: Michael Holzhauser
DOI: https://doi.org/10.1007/978-3-658-16812-4
Publisher: Springer Spektrum Wiesbaden
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Fachmedien Wiesbaden GmbH 2016
Softcover ISBN: 978-3-658-16811-7Published: 12 January 2017
eBook ISBN: 978-3-658-16812-4Published: 04 January 2017
Edition Number: 1
Number of Pages: XVI, 213
Number of Illustrations: 26 b/w illustrations
Topics: Discrete Optimization, Algorithms, Mathematics of Algorithmic Complexity