![Computational complexity theory / Operations research / Approximation algorithm / Asymptotically optimal algorithm / Algorithm / Optimization problem / Combinatorial optimization / Facility location / Greedy algorithm / Theoretical computer science / Applied mathematics / Mathematics Computational complexity theory / Operations research / Approximation algorithm / Asymptotically optimal algorithm / Algorithm / Optimization problem / Combinatorial optimization / Facility location / Greedy algorithm / Theoretical computer science / Applied mathematics / Mathematics](https://www.pdfsearch.io/img/6e449b8854294a35bfae83788802874d.jpg) Date: 2006-07-10 21:18:20Computational complexity theory Operations research Approximation algorithm Asymptotically optimal algorithm Algorithm Optimization problem Combinatorial optimization Facility location Greedy algorithm Theoretical computer science Applied mathematics Mathematics | | ABRAHAM FLAXMAN, Carnegie Mellon University, Pittsburgh, PA, USA On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem In combinatorial optimization, a poAdd to Reading ListSource URL: cms.math.caDownload Document from Source Website File Size: 19,24 KBShare Document on Facebook
|