{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:21Z","timestamp":1725892581453},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_5","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"10-16","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for the Uniform Bounded Facility Problem"],"prefix":"10.1007","author":[{"given":"Kerui","family":"Weng","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Dai, D., Yu, C.: A 5+\u03b5-approximation algorithm for minimum weighted dominating set in unit disk graph. Theoretical Computer Science (2008), doi:10.1016\/j.tcs.2008.11.015","DOI":"10.1016\/j.tcs.2008.11.015"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G. Xu","year":"2008","unstructured":"Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. Journal of Combinatorial Optimization\u00a017, 424\u2013436 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"5_CR3","unstructured":"Charikar, M., Khuller, S., Mount, D. Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the symposium on discrete algorithms, pp. 642\u2013651 (2001)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Shomys, D., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location. In: Proceedings of IPCO, pp. 240\u2013257 (2002)","DOI":"10.1007\/3-540-47867-1_18"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F. Chudak","year":"2003","unstructured":"Chudak, F., Shomys, D.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput.\u00a033, 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","unstructured":"Jain, K., Mahdian, M., Saberi, A.: Approximation algorithms for metric facility location and k-median problems using the primalCdual"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithm for facility location problems. SIAM J. Comput.\u00a034, 803\u2013824 (2005)","journal-title":"SIAM J. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J. Comput.\u00a036, 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-74208-1_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"J. Byrka","year":"2007","unstructured":"Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 29\u201343. Springer, Heidelberg (2007)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Byrka, J., Aardal, K.: The approximation gap for the metric facility location problem is not yet closed. Oper. Res. Lett. (2006)","DOI":"10.1016\/j.orl.2006.03.017"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"2006","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. J. ACM\u00a045, 634\u2013652 (2006)","journal-title":"J. ACM"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (Connected) dominating sets in unit disk graphs. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Y., Gao, X., Zhang, Z., Wu, W.: A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim., 1573\u20132886 (2008)","DOI":"10.1007\/s10878-008-9146-0"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1057\/jors.1991.69","volume":"42","author":"O. Berman","year":"1991","unstructured":"Berman, O., Yang, E.K.: Medi-center location problems. Journal of the Operational Research Society\u00a042, 313\u2013322 (1991)","journal-title":"Journal of the Operational Research Society"},{"key":"5_CR16","first-page":"235","volume":"1","author":"I.C. Choi","year":"1993","unstructured":"Choi, I.C., Chaudhry, S.S.: The p-median problem with maximum distance constraints: a direct approach. Location Science\u00a01, 235\u2013243 (1993)","journal-title":"Location Science"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1011465419252","volume":"5","author":"K. Piotr","year":"2001","unstructured":"Piotr, K., Roberto, S.: Approximation algorithms for bounded facility location problems. Journal of Combinatorial Optimization\u00a05, 233\u2013247 (2001)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T08:10:18Z","timestamp":1560240618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}