Exact and approximation algorithms for network flow and disjoint-path problems.
Stavros G. Kolliopoulos · 1998
Network flow problems form a core area of Combinatorial Optimization. Their significance arises both from their very large number of applications and their theoretical importance. This thesis focuses on efficient exact algorithms for network flow problems in P and on approximation algorithms for NP -hard variants such as disjoint paths and unsplittable flow. Given an n-vertex