{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:58Z","timestamp":1774421338961,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819628445","type":"print"},{"value":"9789819628452","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_26","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:25Z","timestamp":1740067225000},"page":"409-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Connected k-Vertex One-Center Problem on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Jingru","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1007\/s00454-021-00327-y","volume":"66","author":"A Abu-Affash","year":"2021","unstructured":"Abu-Affash, A., Carmi, P., Maheshwari, A., Morin, P., Smid, M., Smorodinsky, S.: Approximating maximum diameter-bounded subgraph in unit disk graphs. Discrete Comput. Geom. 66, 1401\u20131414 (2021)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1007\/s00453-017-0344-y","volume":"80","author":"Y Asahiro","year":"2018","unstructured":"Asahiro, Y., Doi, Y., Miyano, E., Samizo, K., Shimizu, H.: Optimal approximation algorithms for maximum distance-bounded subgraph problems. Algorithmica 80, 1834\u20131856 (2018)","journal-title":"Algorithmica"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2007.02.033","volume":"378","author":"B Ben-Moshe","year":"2007","unstructured":"Ben-Moshe, B., Bhattacharya, B., Shi, Q., Tamar, A.: Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378, 237\u2013252 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"M Bender","year":"2004","unstructured":"Bender, M., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321, 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/0377-2217(94)90321-2","volume":"72","author":"O Berman","year":"1994","unstructured":"Berman, O.: The p maximal cover - p partial center problem on networks. Eur. J. Oper. Res. 72, 432\u2013442 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1111\/j.1538-4632.2009.00746.x","volume":"41","author":"O Berman","year":"2009","unstructured":"Berman, O., Drezner, Z., Wesolowsky, G.: The maximal covering problem with some negative weights. Geogr. Anal. 41, 30\u201342 (2009)","journal-title":"Geogr. Anal."},{"issue":"6","key":"26_CR7","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(01)00079-X","volume":"29","author":"O Berman","year":"2002","unstructured":"Berman, O., Krass, D.: The generalized maximal covering location problem. Comput. Oper. Res. 29(6), 563\u2013581 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J Bourjolly","year":"2002","unstructured":"Bourjolly, J., Laporte, G., Pesant, G.: An exact algorithm for the maximum $$k$$-club problem in an undirected graph. Eur. J. Oper. Res. 138(1), 21\u201328 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ipl.2013.04.011","volume":"113","author":"D Chen","year":"2013","unstructured":"Chen, D., Wang, H.: A note on searching line arrangements and applications. Inf. Process. Lett. 113, 518\u2013521 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1111\/j.1538-4632.1999.tb00979.x","volume":"31","author":"M Daskin","year":"1999","unstructured":"Daskin, M., Owen, S.: Two new location covering problems: the partial $$p$$-center problem and the partial set covering problem. Geogr. Anal. 31(3), 217\u2013235 (1999)","journal-title":"Geogr. Anal."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Dearing, P., Francis, R.: A minimax location problem on a network. Transp. Sci. 8(4) (1974)","DOI":"10.1287\/trsc.8.4.333"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0218195996000186","volume":"6","author":"H Everett","year":"1996","unstructured":"Everett, H., Robert, J.M., van Kreveld, M.: An optimal algorithm for the ($$\\le k$$)-levels and with applications to separation and transversal problems. Int. J. Comput. Geom. Appl. 6(3), 247\u2013261 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.orl.2005.04.011","volume":"34","author":"A Foul","year":"2006","unstructured":"Foul, A.: A $$1$$-center problem on the plane with uniformly distributed demand points. Oper. Res. Lett. 34(3), 264\u2013268 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"G Frederickson","year":"1982","unstructured":"Frederickson, G., Johnson, D.: The complexity of selection and ranking in $$X+Y$$ and matrices with sorted columns. J. Comput. Syst. Sci. 24(2), 197\u2013208 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/trsc.6.4.407","volume":"6","author":"A Goldman","year":"1972","unstructured":"Goldman, A.: Minimax location of a facility in a network. Transp. Sci. 6, 407\u2013418 (1972)","journal-title":"Transp. Sci."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G Handler","year":"1973","unstructured":"Handler, G.: Minimax location of a facility in an undirected tree graph. Transp. Sci. 7, 287\u2013293 (1973)","journal-title":"Transp. Sci."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Hu, R., Kanani, D., Zhang, J.: Computing the center of uncertain points on cactus graphs. In: Proceedings of the 34th International Workshop on Combinatorial Algorithms, pp. 233\u2013245 (2023)","DOI":"10.1007\/978-3-031-34347-6_20"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. I: the $$p$$-centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)","DOI":"10.1137\/0137040"},{"issue":"5","key":"26_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(99)00111-8","volume":"71","author":"Y Lan","year":"1999","unstructured":"Lan, Y., Wang, Y., Suzuki, H.: A linear-time algorithm for solving the center problem on weighted cactus graphs. Inf. Process. Lett. 71(5), 205\u2013212 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"26_CR20","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $$R^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N Megiddo","year":"1981","unstructured":"Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An $$O(n \\log ^2 n)$$ algorithm for the $$k$$-th longest path in a tree with applications to location problems. SIAM J. Comput. 10, 328\u2013337 (1981)","journal-title":"SIAM J. Comput."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/0196-6774(86)90027-1","volume":"7","author":"N Megiddo","year":"1986","unstructured":"Megiddo, N., Zemel, E.: An $$O(n \\log n)$$ randomizing algorithm for the weighted Euclidean 1-center problem. J. Algorithms 7, 358\u2013368 (1986)","journal-title":"J. Algorithms"},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N., Zemel, E., Hakimi, S.: The maximum coverage location problem. SIAM J. Algebraic Discrete Methods 4(2), 253\u2013261 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s00453-016-0158-3","volume":"78","author":"H Wang","year":"2017","unstructured":"Wang, H., Zhang, J.: Computing the center of uncertain points on tree networks. Algorithmica 78(1), 232\u2013254 (2017)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:30Z","timestamp":1740067230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}