{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T21:52:10Z","timestamp":1759701130597},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_10","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"55-63","source":"Crossref","is-referenced-by-count":28,"title":["A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem"],"prefix":"10.1007","author":[{"given":"Adriana","family":"Bumb","sequence":"first","affiliation":[]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K.I. Aardal","year":"1999","unstructured":"Aardal, K.I., Chudak, F., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters, 72, (1999), 161\u2013167","journal-title":"Information Processing Letters"},{"key":"10_CR2","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"Cornuejols, G., Nemhauser, G. L., Wolsey, L. A.: The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, John Wiley and Sons, New York, (1990), 119\u2013171"},{"key":"10_CR3","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility algorithms. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, (1998), 649\u2013657"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k-median problems. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, (1999)","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Munagala, K., Plotkin S.: Cost distance: Two metric network design. Proceedings of the 41th IEEE Symposium on Foundation of Computer Science, (2000)","DOI":"10.1109\/SFCS.2000.892330"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Shmoys, D. Tardos, E. Aardal, K. I.: Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, (1997), 265\u2013274","DOI":"10.1145\/258533.258600"},{"key":"10_CR7","unstructured":"Sviridenko, M.: Personal communication, (1997)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:26:15Z","timestamp":1556385975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}