We present approximation algorithms for the metric uncapacitated facility location problem and the metric <italic>k</italic>-median problem achieving guarantees of 3 and 6 respectively. Theâ€¦ (More)

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it hasâ€¦ (More)

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 uncapacitatedâ€¦ (More)

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 find betterâ€¦ (More)

The Internet, which is intrinsically a common playground for a large number of players with varying degrees of collaborative and sel sh motives, naturally gives rise to numerous new game theoreticâ€¦ (More)

We present approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature ofâ€¦ (More)

Cellular radios consume more power and suffer reduced data rate when the signal is weak. According to our measurements, the communication energy per bit can be as much as 6x higher when the signal isâ€¦ (More)

We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 âˆ’ 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-dual approach,â€¦ (More)