Approximation algorithms for geometric median problems
Information Processing Letters
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Facility Location with Nonuniform Hard Capacities
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
Improved Combinatorial Algorithms for Facility Location Problems
SIAM Journal on Computing
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A Nearly Linear-Time Approximation Scheme for the Euclidean $k$-Median Problem
SIAM Journal on Computing
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Price of anarchy, locality gap, and a network service provider game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Constant factor approximation algorithm for the knapsack median problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
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 show, somewhat surprisingly, that running a single-swap local search for each server type simultaneously, yields a constant factor approximation for this case. Its analysis is however quite non-trivial compared to that of the k-median problem (Arya et al., 2004; Gupta and Tangwongsan, 2008). Later we show that the same algorithm yields a constant approximation for the prize-collecting version of the budgeted red-blue median problem where each client can potentially be served with an alternative cost via a different vendor. In the process, we also improve the approximation factor for the prize-collecting k-median problem from 4 (Charikar et al., 2001) to 3+ε, which matches the current best approximation factor for the k-median problem.