In this project we address the family of Facility Location
problems, intending to address offline and online problems.
Among the offline ones we study the Facility Location
problem and the k-Median problem. Among the online
problems, we consider the Online Facility Location Problem
and the Online Median Problem.
We intend to deal with the offline problems using
approximation algorithm techniques and attack the online
problems using the competitive analysis approach. Our goals
include the development and analysis of new algorithms,
refining the analysis of existing algorithms and obtain better
lower bounds.
Throughout our research, we naturally focused our interest in
the online and incremental versions of the Facility Location
problem, as well as their variants.