dc.contributor.author | Pranabendu Misra | |
dc.date.accessioned | 2017-08-30T08:50:00Z | |
dc.date.available | 2017-08-30T08:50:00Z | |
dc.date.issued | 2017 | |
dc.date.submitted | 2017 | |
dc.identifier.uri | https://dspace.imsc.res.in/xmlui/handle/123456789/408 | |
dc.description.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. | en_US |
dc.publisher.publisher | The Institute of Mathematical Sciences | |
dc.subject | Exact Algorithms | en_US |
dc.subject | Parameterized Complexity | en_US |
dc.subject | Randomized Algorithms | en_US |
dc.subject | Network Design | en_US |
dc.subject | HBNI Th122 | en_US |
dc.title | Parameterized Algorithms for Network Design[HBNI Th122] | en_US |
dc.type.degree | Ph.D | en_US |
dc.type.institution | HBNI | en_US |
dc.description.advisor | Saket Saurabh | |
dc.description.pages | 239p. | en_US |
dc.type.mainsub | Computer Science | en_US |
dc.type.hbnibos | Mathematical Sciences |