{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:28Z","timestamp":1725574108075},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_6","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"59-70","source":"Crossref","is-referenced-by-count":2,"title":["Asymmetry in k-Center Variants"],"prefix":"10.1007","author":[{"given":"Inge","family":"Li G\u00f8rtz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Archer, A.: Inapproximability of the asymmetric facility location and k-median problems (2000) (unpublished manuscript), available at www.orie.cornell.edu\/~aarcher\/Research"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45535-3_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Archer","year":"2001","unstructured":"Archer, A.: Two O(log* k)-approximation algorithms for the asymmetric k-center problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 1\u201314. Springer, Heidelberg (2001)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BFb0054352","volume-title":"Algorithm Theory - SWAT\u201998","author":"R. Bhatia","year":"1998","unstructured":"Bhatia, R., Guha, S., Khuller, S., Sussmann, Y.: Facility location with dynamic distance function. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 23\u201334. Springer, Heidelberg (1998)"},{"key":"6_CR4","unstructured":"Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proc. 12th SODA, pp. 642\u2013651 (2001)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Garg, N., Ravi, R.: The p-neighbor k-center problem. In: Info. Proc. Lett., vol.\u00a065, pp. 131\u2013134 (1998)","DOI":"10.1016\/S0020-0190(97)00224-X"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Guha, S., Khanna, S., Naor, S.: Asymmetric k-center is log\u2009\u2217\u2009 n-hard to approximate. Technical Report 03-038, Elec. Coll. Comp. Complexity (2003)","DOI":"10.1145\/1007352.1007363"},{"key":"6_CR7","unstructured":"Halperin, E., Kortsarz, G., Krauthgamer, R.: Tight lower bounds for the asymmetric k-center problem. Technical Report 03-035, Elec. Coll. Comp. Complexity (2003)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.: A best possible approximation algorithm for the k-center problem. Math. Oper. Res.\u00a010, 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D. Hochbaum","year":"1986","unstructured":"Hochbaum, D., Shmoys, D.: A unified approach to approximation algorithms for bottleneck problems. JACM\u00a033, 533\u2013550 (1986)","journal-title":"JACM"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W. Hsu","year":"1979","unstructured":"Hsu, W., Nemhauser, G.: Easy and hard bottelneck location problems. Disc. Appl. Math.\u00a01, 209\u2013216 (1979)","journal-title":"Disc. Appl. Math."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. I. The p-centers. SIAM J. Appl. Math.\u00a037, 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.: Fault tolerant k-center problems. Theor. Comp. Sci (TCS)\u00a0242, 237\u2013245 (2000)","journal-title":"Theor. Comp. Sci. (TCS)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jagm.1997.0921","volume":"27","author":"R. Panigrahy","year":"1998","unstructured":"Panigrahy, R., Vishwanathan, S.: An O(log\u2009\u2217\u2009 n) approximation algorithm for he asymmetic p-center problem. J. Algorithms\u00a027, 259\u2013268 (1998)","journal-title":"J. Algorithms"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"7","author":"J. Plesnik","year":"1987","unstructured":"Plesnik, J.: A heuristic for the p-center problem in graphs. Disc. Appl. Math.\u00a07, 263\u2013268 (1987)","journal-title":"Disc. Appl. Math."},{"key":"6_CR15","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"6_CR16","unstructured":"Vishwanathan, S.: An O(log\u2009\u2217\u2009 n) approximation algorithm for the asymmetric p-center problem. In: Proc. 7th SODA, pp. 1\u20135 (1996)"}],"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\/978-3-540-45198-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T03:04:50Z","timestamp":1637118290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}