Approximation algorithms for geometric, caching and scheduling problems
In this thesis we study approximation algorithms for optimization problems, which is one of the core areas of modern theoretical computer science. We focus on two areas of approximation. First we consider geometric problems, and we present approximation algorithms for the capacitated location routin...
| Main Author: | |
|---|---|
| Published: |
University of Warwick
2012
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.560419 |