Abstract:
In this thesis we design algorithms for several network design problems in the framework of parameterized complexity and exact algorithms. Along the way, we also give deterministic algorithms for certain problems in matroid theory. Our results adds to the small list of results on network design problems in the realm of parameterized and exact algorithms.