{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:44:51Z","timestamp":1743014691011,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_6","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"62-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"6_CR1","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. 2081, pp. 1\u201314. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_1"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.comgeo.2009.07.003","volume":"47","author":"B Bhattacharya","year":"2014","unstructured":"Bhattacharya, B., Shi, Q.S.: Improved algorithms to network $$p$$-center location problems. Comput. Geom. 47, 307\u2013315 (2014)","journal-title":"Comput. Geom."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: A (slightly) faster algorithm for Klees measure problem. In: Proceedings of the 24th ACM SoCG, pp. 94\u2013100 (2008)","DOI":"10.1145\/1377676.1377693"},{"key":"6_CR4","unstructured":"Chuzhoy, J., Guha, S., Halperin, E., Kortsarz, G., Khanna, S., Naor, S.: Asymmetric $$k$$-center is $$\\log ^\\ast n$$-hard to approximate. In: Proceedings of the 36th STOC, pp. 21\u201327 (2004)"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s10878-012-9591-7","volume":"28","author":"W Ding","year":"2014","unstructured":"Ding, W., Qiu, K.: Algorithms for the minimum diameter terminal steiner tree problem. J. Comb. Optim. 28(4), 837\u2013853 (2014)","journal-title":"J. Comb. Optim."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Ding, W., Qiu, K.: Minimum diameter $$k$$-steiner forest. In: Proceedings of the 12th AAIM, pp. 1\u201311 (2018)","DOI":"10.1007\/978-3-030-04618-7_1"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"ME Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: A simple heuristic for the $$p$$-centre problem. Oper. Res. Lett. 3, 285\u2013288 (1985)","journal-title":"Oper. Res. Lett."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2006.05.009","volume":"361","author":"IL G\u00f8rtz","year":"2006","unstructured":"G\u00f8rtz, I.L., Wirth, A.: Asymmetry in $$k$$-center variants. Theor. Comput. Sci. 361, 188\u2013199 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S.L.: Optimal distribution of switching centers in a communications network and some related graph-theoretic problems. Oper. Res. 13, 462\u2013475 (1965)","journal-title":"Oper. Res."},{"key":"6_CR11","unstructured":"Halperin, E., Kortsarz, G., Krauthgamer, R.: Tight lower bounds for the asymmetric $$k$$-center problem. Technical report, 03-035, Electronic Colloquium on Computational Complexity (2003)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the $$k$$-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33, 533\u2013550 (1986)","journal-title":"J. ACM"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"WL Hsu","year":"1979","unstructured":"Hsu, W.L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discrete Appl. Math. 1, 209\u2013215 (1979)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the $$p$$-centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.orl.2012.12.007","volume":"41","author":"HY Liang","year":"2013","unstructured":"Liang, H.Y.: The hardness and approximation of the star $$p$$-hub center problem. Oper. Res. Lett. 41, 138\u2013141 (2013)","journal-title":"Oper. Res. Lett."},{"key":"6_CR17","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 ^\\ast n)$$ approximation algorithm for the asymmetric $$p$$-center problem. J. Algorithms 27, 259\u2013268 (1998)","journal-title":"J. Algorithms"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk, J.: A heuristic for the $$p$$-center problem in graphs. Discrete Appl. Math. 17, 263\u2013268 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1137\/0401038","volume":"1","author":"A Tamir","year":"1988","unstructured":"Tamir, A.: Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J. Discrete Math. 1(3), 377\u2013396 (1988)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:16:29Z","timestamp":1709824589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}