{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:41:14Z","timestamp":1649202074897},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T00:00:00Z","timestamp":1345593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10878-012-9540-5","type":"journal-article","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T15:50:10Z","timestamp":1345564210000},"page":"609-620","source":"Crossref","is-referenced-by-count":2,"title":["A unified dual-fitting approximation algorithm for the facility location problems with linear\/submodular penalties"],"prefix":"10.1007","volume":"27","author":[{"given":"Yu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,22]]},"reference":[{"key":"9540_CR1","first-page":"642","volume-title":"Proceedings of SODA","author":"M Charikar","year":"2001","unstructured":"Charikar M, Khuller S, Mount DM, Naraasimban G (2001) Algorithms for facility location problems with outliers. In: Proceedings of SODA, pp 642\u2013651"},{"key":"9540_CR2","first-page":"79","volume-title":"Proceedings of SODA","author":"FA Chudak","year":"2007","unstructured":"Chudak FA, Nagano K (2007) Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovasz extension and non-smooth convex optimization. In: Proceedings of SODA, pp 79\u201388"},{"key":"9540_CR3","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, Xu D (2012) A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63:191\u2013200","journal-title":"Algorithmica"},{"key":"9540_CR4","series-title":"Annals of discrete mathematics","volume-title":"Submodular functions and optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige S (2005) Submodular functions and optimization, 2nd edn. Annals of discrete mathematics, vol\u00a058. Elsevier, Amsterdam","edition":"2"},{"key":"9540_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10107-009-0310-9","volume":"130","author":"J Geunes","year":"2011","unstructured":"Geunes J, Levi R, Romeijn HE, Shmoys DB (2011) Approximation algorithms for supply chain planning and logistics problems with market choice. Math Program 130:85\u2013106","journal-title":"Math Program"},{"key":"9540_CR6","first-page":"933","volume-title":"Proceedings of SODA","author":"A Hayrapetyan","year":"2005","unstructured":"Hayrapetyan A, Swamy C, Tard\u00f6s E (2005) Network design for information networks. In: Proceedings of SODA, pp 933\u2013942"},{"key":"9540_CR7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48:274\u2013296","journal-title":"J ACM"},{"key":"9540_CR8","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain K, Mahdian M, Markakis E, Saberi A, Vazirani VV (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50:795\u2013824","journal-title":"J ACM"},{"key":"9540_CR9","first-page":"77","volume-title":"Proceedings of ICALP, part\u00a0II","author":"S Li","year":"2011","unstructured":"Li S (2011) A 1.488 approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP, part\u00a0II, pp 77\u201388"},{"key":"9540_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M Mahdian","year":"2006","unstructured":"Mahdian M, Ye Y, Zhang J (2006) Improved approximation algorithms for metric facility location problems. SIAM J Comput 36:411\u2013432","journal-title":"SIAM J Comput"},{"key":"9540_CR11","first-page":"265","volume-title":"Proceedings of STOC","author":"DB Shmoys","year":"1997","unstructured":"Shmoys DB, Tard\u00f6s E, Aardal KI (1997) Approximation algorithms for facility location problems (extended abstract). In: Proceedings of STOC, pp 265\u2013274"},{"key":"9540_CR12","first-page":"178","volume-title":"Proceedings of SODA","author":"M Thorup","year":"2003","unstructured":"Thorup M (2003) Quick and good facility location. In: Proceedings of SODA, pp 178\u2013185"},{"key":"9540_CR13","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, Xu J (2005) An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inf Process Lett 94:119\u2013123","journal-title":"Inf Process Lett"},{"key":"9540_CR14","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G Xu","year":"2008","unstructured":"Xu G, Xu J (2008) An improved approximation algorithm for uncapacitated facility location problem with penalties. J Comb Optim 17:424\u2013436","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9540-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9540-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9540-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:19Z","timestamp":1559276599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9540-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,22]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9540"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9540-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,22]]}}}