{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T09:07:52Z","timestamp":1743844072646,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859291"},{"type":"electronic","value":"9783540859307"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85930-7_11","type":"book-chapter","created":{"date-parts":[[2008,9,5]],"date-time":"2008-09-05T13:11:13Z","timestamp":1220620273000},"page":"76-83","source":"Crossref","is-referenced-by-count":1,"title":["A General k-Level Uncapacitated Facility Location Problem"],"prefix":"10.1007","author":[{"given":"Rongheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huei-Chuen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K. Aardal","year":"1999","unstructured":"Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inform. Process. Lett.\u00a072, 161\u2013167 (1999)","journal-title":"Inform. Process. Lett."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F.A. Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput.\u00a033, 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"volume-title":"Computers and Intractability- A guide to the Theory of NP-Completeness","year":"1979","key":"11_CR3","unstructured":"Garey, M.R., Johnson, D.S. (eds.): Computers and Intractability- A guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1979)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy Strikes Back: Improved Facility Location Algorithms. J. Algorithm\u00a031, 228\u2013248 (1999)","journal-title":"J. Algorithm"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A New Greedy Approach for Facility Location Problem. In: Reif, J. (ed.) Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), Association for Computing Machinery, pp. 731\u2013740 (2002)","DOI":"10.1145\/509907.510012"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.V.: Primal-dual Approximation Algorithms for Metric Facility Location and k-median Problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 2\u201313 (1999)","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.W.: Improved Approximation Algorithms for Metric Facility Location Problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"key":"11_CR8","first-page":"265","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","author":"D.B. Shmoys","year":"1997","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.I.: Approximation Algorithms for Facility Location Problems. In: Tom Leighton, F., Shor, P. (eds.) Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265\u2013274. ACM, New York (1997)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J.W. Zhang","year":"2006","unstructured":"Zhang, J.W.: Approximating the Two-level Facility Location Problem Via a Quasi-greedy Approach. Mathematical Programming\u00a0108, 159\u2013176 (2006)","journal-title":"Mathematical Programming"}],"container-title":["Communications in Computer and Information Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85930-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T21:04:55Z","timestamp":1738357495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85930-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859291","9783540859307"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85930-7_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2008]]}}}