Parametric search approach forgraph packing problems

Abstract

This thesis presents some algorithm for combinatorial optimization, based on parametric search and Newton´s approach. We consider two topics in graph theory. In the first part, we describe balanced network and submodular flow problem and related algorithms. The second part deals with packing problems in graphs.