{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:43:49Z","timestamp":1787503429381,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343752","type":"print"},{"value":"9783540343783","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_22","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T06:34:15Z","timestamp":1149230055000},"page":"211-222","source":"Crossref","is-referenced-by-count":7,"title":["Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems"],"prefix":"10.1007","author":[{"given":"Erez","family":"Kantor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2004.05.005","volume":"33","author":"E. Althaus","year":"2005","unstructured":"Althaus, E., Funke, S., Har-Peled, S., Koenemann, J., Ramos, E.A., Skutella, M.: Approximation k-hop minimum-spanning trees. Operations Research Letters\u00a033, 115\u2013120 (2005)","journal-title":"Operations Research Letters"},{"key":"22_CR2","unstructured":"Bar-ilan, J., Kortsarz, G., Peleg, D.: Generalized aubmodular cover problems and applications. In: Proc. 4th Israel Symp. on Theory of Computing and Systems, pp. 110\u2013118 (1996)"},{"key":"22_CR3","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pp. 192\u2013200 (1998)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chudak, F.A.: Improved approximation algorithm for uncapacitated facility location problem. In: Proc. 6th Conf. on Integer Programing and Combinatorial Optimization, pp. 180\u2013194 (1998)","DOI":"10.1007\/3-540-69346-7_14"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-002-0985-2","volume":"35","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Penna, P., Ferreira, A., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica\u00a035(2), 95\u2013110 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"A.E.F. Clementi","year":"2004","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Network Applic.\u00a09(2), 125\u2013140 (2004)","journal-title":"Mobile Network Applic."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 314\u2013318 (1996)","DOI":"10.1145\/237814.237977"},{"key":"22_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"22_CR9","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, A.F., Shmoys, B.D.: A 3-approximation algorithm for the K-level uncapacitated facility location problem. Information Processing Letters\u00a072, 161\u2013167 (1999)","journal-title":"Information Processing Letters"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kirousis, L.M., Kranakis, E., Kriznac, D., Pelc, A.: Power consumption in packet radio networks. In: Proc. 14th Symp. on Theoretical Aspects of Computer Science, pp. 363\u2013374 (1997)","DOI":"10.1007\/BFb0023473"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: Approximating the weight of shallow steiner trees. Discrete Applied Math., 265\u2013285 (1999)","DOI":"10.1016\/S0166-218X(99)00111-0"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Lin, J.H., Vitter, J.S.: \u03b5\u2212approximations with small packing constraint violation. In: Proc. 24th ACM Symp. on Theory of Computing, pp. 771\u2013782 (1992)","DOI":"10.1145\/129712.129787"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM\u00a041, 960\u2013981 (1994)","journal-title":"J. ACM"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: A 1.52-approximation algorithm for the uncapacitated facility location problem. In: Proc. 5th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 229\u2013242 (2002)","DOI":"10.1007\/3-540-45753-4_20"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Shmoys, B.D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. 29th ACM Symp. on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:22Z","timestamp":1619492662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11758471_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}