Advertisement

Conclusion

  • Michael Holzhauser
Chapter

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.

Copyright information

© Springer Fachmedien Wiesbaden GmbH 2016

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of KaiserslauternKaiserslauternGermany

Personalised recommendations