Budgeted Red-Blue Median and Its Generalizations

In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget constraint on the number of deployed servers of each type. The simplest goal here is to deploy a set of servers subject to these budget constraints in order to minimize the sum of client connection costs. These connection costs often satisfy metricity, since they are typically proportional to the distance between a client and a server within a single autonomous system. A special case of the problem where there is only one server type is the well-studied k-median problem. In this paper, we consider the problem with two server types and call it the budgeted red-blue median problem. We focus on the efficient local search techniques (that requires no use of an LP. The running times of LP's are often very high). We show, somewhat surprisingly, that running a single-swap local search for each server type simulta...

• Type: Conference
• Year: 2010
• Where: ESA
• Authors: MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
• Keywords: Algorithms, ESA 2010, K-median Problem, Red-blue Median Problem, Server Type