A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem

2005
*
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
*

In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guaranteed to produce a solution which is within a known multiplicative factor of optimal. Unfortunately, the known factor is often known to be large in pathological instances. Conventional wisdom holds that, in practice, approximation algorithms will produce solutions closer to optimal than their proven guarantees. In this

doi:10.1145/1060590.1060656
dblp:conf/stoc/FlaxmanFV05
fatcat:lmgeeypfh5cvxao4zz4zhvmt54