{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:01:05Z","timestamp":1766066465171},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,11,28]],"date-time":"2014-11-28T00:00:00Z","timestamp":1417132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11424-014-2157-2","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T09:50:08Z","timestamp":1417427408000},"page":"1102-1114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximation algorithms for the priority facility location problem with penalties"],"prefix":"10.1007","volume":"28","author":[{"given":"Fengmin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,28]]},"reference":[{"key":"2157_CR1","first-page":"265","volume-title":"Proceedings of STOC","author":"D B Shmoys","year":"1997","unstructured":"Shmoys D B, Tardos \u00c9, and Aardal K I, Approximation algorithms for facility location problems, Proceedings of STOC, 1997, 265\u2013274."},{"key":"2157_CR2","first-page":"77","volume-title":"Proceedings of ICALP, Part II","author":"S Li","year":"2011","unstructured":"Li S, A 1.488-approximation algorithm for the uncapacitated facility location problem, Proceedings of ICALP, Part II, 2011, 77\u201388."},{"key":"2157_CR3","first-page":"649","volume-title":"Proceedings of SODA","author":"S Guha","year":"1998","unstructured":"Guha S and Khuller S, Greedy strikes back: Improved facility location algorithms, Proceedings of SODA, 1998, 649\u2013657."},{"key":"2157_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"A Ageev","year":"2003","unstructured":"Ageev A, Ye Y, and Zhang J, Improved combinatorial approximation algorithms for the k-level facility location problem, SIAM J. Discrete Math., 2003, 18: 207\u2013217.","journal-title":"SIAM J. Discrete Math."},{"key":"2157_CR5","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M Charikar","year":"2005","unstructured":"Charikar M and Guha S, Improved combinatorial algorithms for facility location problems, SIAM J. Comput., 2005, 34: 803\u2013824.","journal-title":"SIAM J. Comput."},{"key":"2157_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J Zhang","year":"2005","unstructured":"Zhang J, Chen B, and Ye Y, A multiexchange local search algorithm for the capacitated facility location problem, Math. Oper. Res., 2005, 30: 389\u2013403.","journal-title":"Math. Oper. Res."},{"key":"2157_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J Zhang","year":"2006","unstructured":"Zhang J, Approximating the two-level facility location problem via a quasi-greedy approach, Math. Program., 2006, 108: 159\u2013176.","journal-title":"Math. Program."},{"key":"2157_CR8","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.tcs.2007.05.024","volume":"384","author":"P Zhang","year":"2007","unstructured":"Zhang P, A new approximation algorithm for the k-facility location problem, Theor. Comput. Sci., 2007, 384: 126\u2013135.","journal-title":"Theor. Comput. Sci."},{"key":"2157_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00453-007-9032-7","volume":"53","author":"X Chen","year":"2009","unstructured":"Chen X and Chen B, Approximation algorithms for soft-capacitated facility location in capacitated network design, Algorithmica, 2009, 53: 263\u2013297.","journal-title":"Algorithmica"},{"key":"2157_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10878-009-9213-1","volume":"20","author":"D Du","year":"2010","unstructured":"Du D, Wang X, and Xu D, An approximation algorithm for the k-level capacitated facility location problem, J. Comb. Optim., 2010, 20: 361\u2013368.","journal-title":"J. Comb. Optim."},{"key":"2157_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.1090.0302","volume":"44","author":"J Shu","year":"2010","unstructured":"Shu J, An efficient greedy heuristic for warehouse-retailer network design optimization, Transport. Sci., 2010, 44: 183\u2013192.","journal-title":"Transport. Sci."},{"key":"2157_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du D, Lu R, and Xu D, A primal-dual approximation algorithm for the facility location problem with submodular penalties, Algorithmica, 2012, 63: 191\u2013200.","journal-title":"Algorithmica"},{"key":"2157_CR13","first-page":"642","volume-title":"Proceedings of SODA","author":"M Charikar","year":"2001","unstructured":"Charikar M, Khuller S, Mount D M, and Narasimhan G, Algorithms for facility location problems with outliers, Proceedings of SODA, 2001, 642\u2013651."},{"key":"2157_CR14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G Xu","year":"2005","unstructured":"Xu G and Xu J, An LP-rounding algorithm for approximating uncapacitated facility location problem with penalties, Inform. Process. Lett., 2005, 94: 119\u2013123.","journal-title":"Inform. Process. Lett."},{"key":"2157_CR15","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G Xu","year":"2008","unstructured":"Xu G and Xu J, An improved approximation algorithm for uncapacitated facility location problem with penalties, J. Comb. Optim., 2008, 17: 424\u2013436.","journal-title":"J. Comb. Optim."},{"key":"2157_CR16","first-page":"933","volume-title":"Proceedings of SODA","author":"A Hayrapetyan","year":"2005","unstructured":"Hayrapetyan A, Swamy C, and Tardos \u00c9, Network design for information networks, Proceedings of SODA, 2005, 933\u2013942."},{"key":"2157_CR17","first-page":"79","volume-title":"Proceedings of SODA","author":"F A Chudak","year":"2007","unstructured":"Chudak F A and Nagano K, Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lov\u00e1sz extension and non-smooth convex optimization, Proceedings of SODA, 2007, 79\u201388."},{"key":"2157_CR18","first-page":"342","volume-title":"Proceedings of SODA","author":"R Ravi","year":"2004","unstructured":"Ravi R and Sinha A, Multicommodity facility location, Proceedings of SODA, 2004, 342\u2013349."},{"key":"2157_CR19","volume-title":"Facility location and the analysis of algorithms through factor-revealing problems","author":"M Mahdian","year":"2004","unstructured":"Mahdian M, Facility location and the analysis of algorithms through factor-revealing problems, Ph.D.\u2019s degree thesis, Massachusetts Institute of Technology, Cambridge, MA, 2004."},{"issue":"7","key":"2157_CR20","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1080\/02331934.2011.611511","volume":"62","author":"G Li","year":"2013","unstructured":"Li G, Wang Z, and Wu C, Approximation algorithms for the stochastic priority facility location problem, Optimization, 2013, 62(7): 919\u2013928.","journal-title":"Optimization"},{"key":"2157_CR21","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K and Vazirani V V, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 2001, 48: 274\u2013296.","journal-title":"J. ACM"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2157-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-014-2157-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2157-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:54:06Z","timestamp":1559386446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-014-2157-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,28]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["2157"],"URL":"https:\/\/doi.org\/10.1007\/s11424-014-2157-2","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,28]]}}}