Join our mailing list
Get exclusive deals and learn about new products!
Reliable shipping
Flexible returns
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.
Published by: Springer Spektrum
Publication Date: 2017-01-12
Format: Paperback
ISBN-13: 9783658168117
DOI: 10.1007/978-3-658-16812-4
Dimensions: 210cm x148cm
Pages: 213