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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
