{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:40:28Z","timestamp":1702028428444},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11424-012-9067-y","type":"journal-article","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T12:08:06Z","timestamp":1334059686000},"page":"287-292","source":"Crossref","is-referenced-by-count":2,"title":["A cost-sharing method for an uncapacitated facility location game with penalties"],"prefix":"10.1007","volume":"25","author":[{"given":"Zhen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,11]]},"reference":[{"key":"9067_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K. Aardal","year":"1999","unstructured":"K. Aardal, F. Chudak, and D. Shmoys, A 3-approximation algorithm for the k-level uncapacitated facility location problem, Information Processing Letters, 1999, 72: 161\u2013167.","journal-title":"Information Processing Letters"},{"issue":"1","key":"9067_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"A. Ageev","year":"2004","unstructured":"A. Ageev, Y. Ye, and J. Zhang, Improved combinatorial approximation algorithms for the k-level location problem, SIAM Journal on Discrete Mathematics, 2004, 18(1): 207\u2013217.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9067_CR3","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J. Byrka","year":"2010","unstructured":"J. Byrka and K. I. Aardal, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, SIAM Journal on Computing, 2010, 39: 2212\u20132231.","journal-title":"SIAM Journal on Computing"},{"key":"9067_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M. Mahdian","year":"2006","unstructured":"M. Mahdian, Y. Ye, and J. Zhang, Approximation algorithms for metric facility location problems, SIAM Journal on Computing, 2006, 36: 411\u2013432.","journal-title":"SIAM Journal on Computing"},{"key":"9067_CR5","doi-asserted-by":"crossref","unstructured":"D. B. Shmoys, E. Tard\u00f6s, and K. I. Aardal, Approximation algorithms for facility location problems, Proceedings of STOC, 1997.","DOI":"10.1145\/258533.258600"},{"issue":"1","key":"9067_CR6","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.orl.2007.04.002","volume":"36","author":"D. Xu","year":"2008","unstructured":"D. Xu and S. Zhang, Approximation algorithm for facility location with service installation costs, Operations Research Letters, 2008, 36(1): 46\u201350.","journal-title":"Operations Research Letters"},{"key":"9067_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J. Zhang","year":"2006","unstructured":"J. Zhang, Approximating the two-level facility location problem via a quasi-greedy approach, Mathematical Programming, 2006, 108: 159\u2013176.","journal-title":"Mathematical Programming"},{"key":"9067_CR8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J. Zhang","year":"2005","unstructured":"J. Zhang, B. Chen, and Y. Ye, A multiexchange local search algorithm for the capacitated facility location problem, Mathematics of Operations Research, 2005, 30: 389\u2013403.","journal-title":"Mathematics of Operations Research"},{"key":"9067_CR9","unstructured":"M. Charikar, S. Khuller, D. M. Mount and G. Naraasimban, Algorithms for facility location problems with outliers, Proceedings of SODA, 2001."},{"key":"9067_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G. Xu","year":"2005","unstructured":"G. Xu and J. Xu, An LP rounding algorithm for approximating uncapacitated facility location problem with penalities, Information Processing Letters, 2005, 94: 119\u2013123.","journal-title":"Information Processing Letters"},{"key":"9067_CR11","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G. Xu","year":"2009","unstructured":"G. Xu and J. Xu, An improved approximation algorithm for uncapacitated facility location problems with penalties, Journal of Combinatorial Optimization, 2009, 17: 424\u2013436.","journal-title":"Journal of Combinatorial Optimization"},{"key":"9067_CR12","unstructured":"M. P\u00e1l and E. Tard\u00f6s, Group strategyproof mechanisms via primal-dual algorithms, Proceedings of FOCS, 2003."},{"key":"9067_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D. Xu","year":"2006","unstructured":"D. Xu and D. Du, The k-level facility location game, Operations Research Letters, 2006, 34: 421\u2013426.","journal-title":"Operations Research Letters"},{"issue":"1","key":"9067_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10255-008-8111-0","volume":"26","author":"Y. Li","year":"2010","unstructured":"Y. Li and D. Xu, Soft-capacity facility location game, Acta Mathematicae Applicatae Sinica, English Series, 2010, 26(1): 93\u201398.","journal-title":"Acta Mathematicae Applicatae Sinica, English Series"},{"key":"9067_CR15","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"H. Moulin and S. Shenker, Strategyproof sharing of submodular cost: Budget balance versus effciency, Journal of Economic Theory, 2001, 18: 511\u2013533.","journal-title":"Journal of Economic Theory"},{"key":"9067_CR16","unstructured":"R. R. Mettu and C. G. Plaxton, The online median problem, Proceedings of FOCS, 2000."},{"key":"9067_CR17","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"K. Jain and V. V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median probelms, Jounal of the ACM, 2001, 48: 274\u2013296.","journal-title":"Jounal of the ACM"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-9067-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-012-9067-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-9067-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T03:30:55Z","timestamp":1561606255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-012-9067-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9067"],"URL":"https:\/\/doi.org\/10.1007\/s11424-012-9067-y","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4]]}}}