Generalized Network Improvement and Packing Problems

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.

Publication Year: 2016
Imprint: Springer Fachmedien Wiesbaden
Format: P
Weight (Gram): 3052