{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:49:54Z","timestamp":1742633394329},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s1571-0653(05)80067-8","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T23:09:41Z","timestamp":1115420981000},"page":"14-17","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A simple dual ascent algorithm for the multilevel facility location problem"],"prefix":"10.1016","volume":"8","author":[{"given":"A.F.","family":"Dumb","sequence":"first","affiliation":[]},{"given":"W.","family":"Kern","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80067-8_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","article-title":"A 3-approximation algorithm for the k-level uncapacitated facility location problem","volume":"72","author":"Aardal","year":"1999","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0653(05)80067-8_BIB2","first-page":"649","article-title":"Greedy strikes back: improved facility algorithms","author":"Guha","year":"1998","journal-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"10.1016\/S1571-0653(05)80067-8_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/SFFCS.1999.814571","article-title":"Primal-dual approximation algorithms for metric facility location and k\u2013;median problems","author":"Jain","year":"1999","journal-title":"Proceedings of the Twenty-Ninth Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/S1571-0653(05)80067-8_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.2000.892330","article-title":"Cost distance: Two metric network design","author":"Meyerson","year":"2000","journal-title":"Proceedings of the 41-th IEEE Symposium on Foundation of Computer Science"},{"key":"10.1016\/S1571-0653(05)80067-8_BIB5","first-page":"265","article-title":"Approximation algorithms for facility location problems","author":"Shmoys","year":"1997","journal-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800678?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800678?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T10:03:34Z","timestamp":1550484214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305800678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":5,"alternative-id":["S1571065305800678"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80067-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}