Approximations to Generalized Facility Location Problems
There are a wide variety of facility location problems, from k-medians to k-center. While many approximations algorithms are known for
these problems, fewer techniques are known for more general facility location problems like the Ordered Medians and k-facility p-centrum
problems. This research is focused on creating new approximation algorithms for these and similar problems. We present a number of
different algorithms, some that are new and others that extend existing techniques for different problems, and prove theorems about their
run time and approximation factors.