Content delivery networks (CDNs) have gained immense popularity over the years. Replica
server placement is a key design issue in CDNs. It entails placing replica servers at …

How does a search engine company decide what ads to display with each query so as to
maximize its revenue? This turns out to be a generalization of the online bipartite matching …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP.
This combination is used to design and analyze two greedy algorithms for the metric …

We present a simple and natural greedy algorithm for the metric uncapacitated facility
location problem achieving an approximation guarantee of 1.61. We use this algorithm to …

We consider the uncapacitated facility location problem. In this problem, there is a set of
locations at which facilities can be built; a fixed cost fi is incurred if a facility is opened at …

An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Page 1 An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location …

In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility
location problem, and a 2-approximation algorithm for the metric capacitated facility location …

In this paper we present a 1.52-approximation algorithm for the uncapacitated metric facility
location problem. This algorithm uses an idea of cost scaling, a greedy algorithm of Jain …

We present improved combinatorial approximation algorithms for the uncapacitated facility
location problem. Two central ideas in most of our results are cost scaling and greedy …