Approximation algorithms for facility location problems

Abstract

An approximation algorithm is presented to solve a variety of facility location problems. In each facility location problem, a set of locations where a facility may be built is given and this set of locations must minimize the total facility and assignment cost. In an uncapacitated case, each facility can service an unlimited number of clients, while in the capacitated case, each facility can only serve most clients. The approximation algorithm finds a solution of a cost within a factor of 3.16 of the optimum, provided the distances between the locations are symmetric and satisfy the triangle inequality.