A faster dynamic programming algorithm for facility location

Abstract

We study the following 1D and 1.5D problems: Given a set of m server locations {t1,...,tm}, lying along the x-axis and specified in increasing order, and n client locations {p1,..., pn}, also specified in increasing order along th