References
- AardalKChudakFAShmoysDBA 3-approximation algorithm for the k-level uncapacitated facility location problemInformation Processing Letters1999725–616116710.1016/S0020-0190(99)00144-1
- AgeevAAImproved approximation algorithms for multilevel facility location problemsOperations Research Letters200230532733210.1016/S0167-6377(02)00162-1
- Bumb AF and Kern W (2001). A simple dual ascent algorithm for the multilevel facility location problem. In: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Vol. 2129, LNCS, pp 55–62.
- ChudakFAShmoysDBImproved approximation algorithms for the uncapacitated facility location problemSIAM Journal on Computing200333112510.1137/S0097539703405754
- GareyMRJohnsonDSComputers and Intractability—A Guide to the Theory of NP-Completeness1979
- GuhaSKhullerSGreedy strikes back: Improved facility location algorithmsJournal of Algorithm199931122824810.1006/jagm.1998.0993
- JainKVaziraniVVPrimal-dual approximation algorithms for metric facility location and k-median problemsProceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science1999213
- JainKMahdianMSaberiAA new greedy approach for facility location problemProceedings of the 34th ACM Symposium on Theory of Computing (STOC)2002731740
- KorteBVygenJCombinatorial Optimization—Theory and Algorithms2007
- Mahdian M, Ye Y and Zhang JW (2002). Improved approximation algorithms for metric facility location problems. In: 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Vol. 2492, LNCS, pp 229–242.
- ShmoysDBTardosEAardalKIApproximation algorithms for facility location problemsThe Proceedings of the 29th Annual ACM Symposium on Theory of Computing1997265274
- ZhangJWApproximating the two-level facility location problem via a quasi-greedy approachThe 15th ACM-SIAM Symposium on Discrete Algorithms SODA2004808817