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 po - Location theory - Document - PDFSEARCH.IO

First Page	Meta Content
	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 po Add to Reading List Document Date: 2006-07-10 21:18:20 Open Document File Size: 19,24 KB Share Result on Facebook Facility Carnegie Mellon University / / IndustryTerm related approximation algorithms / approximation algorithms / / Organization Carnegie Mellon University / Pittsburgh / / Technology three related approximation algorithms / approximation algorithms / three algorithms / / SocialTag Computational complexity theory Operations research Approximation algorithm Asymptotically optimal algorithm Algorithm Optimization problem Combinatorial optimization Facility location Greedy algorithm Theoretical computer science

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 List