Approximation algorithms for network design and orienteering
Approximation algorithms for network design and orienteering, 2010.
low-cost networkapproximation ratio2-vertex-connected subgraphreduction algorithmlow costMore(6+)
This thesis presents approximation algorithms for some NP -Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P ≠ NP , there are no efficient (i.e., polynomial-time) algorithms that solve these problems ...More
Full Text (Upload PDF)
PPT (Upload PPT)