AUTHOR: Pollatos Gerasimos
TITLE: Network optimization problems with cardinality constraints
- Algorithmic Operations Research
- Supervisor: Zissimopoulos Vassilios
- Advisor: Elias Koutsoupias
- Advisor: Stavros Kolliopoulos
The subject of this dissertation will be the design and analysis of effective approximation algorithms regarding problems of data placement and recovery in the field of web caching as well as network design problems and facility location problems. We focus in the constrained cardinality versions of the above problems.