{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:48Z","timestamp":1774421328944,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T00:00:00Z","timestamp":1697068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T00:00:00Z","timestamp":1697068800000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-023-02226-w","type":"journal-article","created":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T12:02:33Z","timestamp":1697112153000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Iterated Local Search for the Minimum Edge-Dilation K-Center Problem"],"prefix":"10.1007","volume":"4","author":[{"given":"Manisha","family":"Israni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-0892","authenticated-orcid":false,"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,12]]},"reference":[{"key":"2226_CR1","doi-asserted-by":"crossref","unstructured":"Abraham I, Gavoille C, Malkhi D, Nisan N, Thorup M. Compact name-independent routing with minimum stretch. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, pp. 20\u20134.","DOI":"10.1145\/1007912.1007916"},{"issue":"3","key":"2226_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B Awerbuch","year":"1990","unstructured":"Awerbuch B, Bar-Noy A, Linial N, Peleg D. Improved routing strategies with succinct tables. J Algorithms. 1990;11(3):307\u201341.","journal-title":"J Algorithms"},{"key":"2226_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Peleg, D. Sparse partitions. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 503\u201313.","DOI":"10.1109\/FSCS.1990.89571"},{"key":"2226_CR4","volume-title":"A c++ implementation of tabu search for k- cardinality tree problem based on generic programming and component reuse","author":"MJ Blesa","year":"2000","unstructured":"Blesa MJ, Xhafa F. A c++ implementation of tabu search for k- cardinality tree problem based on generic programming and component reuse. Citeseer: Young Researchers Workshop; 2000."},{"issue":"6","key":"2226_CR5","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/j.cor.2003.11.007","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C, Blesa MJ. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput Oper Res. 2005;32(6):1355\u201377.","journal-title":"Comput Oper Res"},{"key":"2226_CR6","doi-asserted-by":"crossref","unstructured":"Chechik S. Compact routing schemes with improved stretch. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, 2013, pp. 33\u201341.","DOI":"10.1145\/2484239.2484268"},{"issue":"1","key":"2226_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"LJ Cowen","year":"2001","unstructured":"Cowen LJ. Compact routing with minimum stretch. J Algorithms. 2001;38(1):170\u201383.","journal-title":"J Algorithms"},{"issue":"10","key":"2226_CR8","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1016\/j.cor.2010.12.002","volume":"38","author":"T Davidovi\u0107","year":"2011","unstructured":"Davidovi\u0107 T, Ramljak D, \u0160elmi\u0107 M, Teodorovi\u0107 D. Bee colony optimization for the p-center problem. Comput Oper Res. 2011;38(10):1367\u201376.","journal-title":"Comput Oper Res"},{"issue":"2","key":"2226_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0196-6774(03)00002-6","volume":"46","author":"T Eilam","year":"2003","unstructured":"Eilam T, Gavoille C, Peleg D. Compact routing schemes with low stretch factor. J Algorithms. 2003;46(2):97\u2013114.","journal-title":"J Algorithms"},{"key":"2226_CR10","doi-asserted-by":"publisher","first-page":"109228","DOI":"10.1109\/ACCESS.2019.2933875","volume":"7","author":"J Garcia-Diaz","year":"2019","unstructured":"Garcia-Diaz J, Menchaca-Mendez R, Menchaca-Mendez R, Hern\u00e1ndez SP, P\u00e9rez-Sansalvador JC, Lakouari N. Approximation algorithms for the vertex k-center problem: survey and experimental evaluation. IEEE Access. 2019;7:109228\u201345.","journal-title":"IEEE Access"},{"issue":"1\u20132","key":"2226_CR11","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 YJ. Fault tolerant k-center problems. Theoret Comput Sci. 2000;242(1\u20132):237\u201345.","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"2226_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller S, Sussmann YJ. The capacitated k-center problem. SIAM J Discret Math. 2000;13(3):403\u201318.","journal-title":"SIAM J Discret Math"},{"issue":"5","key":"2226_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.orl.2003.11.011","volume":"32","author":"J K\u00f6nemann","year":"2004","unstructured":"K\u00f6nemann J, Li Y, Parekh O, Sinha A. An approximation algorithm for the edge-dilation k-center problem. Oper Res Lett. 2004;32(5):491\u20135.","journal-title":"Oper Res Lett"},{"issue":"3","key":"2226_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1273445.1273450","volume":"37","author":"D Krioukov","year":"2007","unstructured":"Krioukov D, Claffy K, Fall K, Brady A. On compact routing for the internet. ACM SIGCOMM Comput Commun Rev. 2007;37(3):41\u201352.","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"2226_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cor.2018.12.017","volume":"104","author":"AD L\u00f3pez-S\u00e1nchez","year":"2019","unstructured":"L\u00f3pez-S\u00e1nchez AD, S\u00e1nchez-Oro J, Hern\u00e1ndez-D\u00edaz AG. Grasp and vns for solving the p-next center problem. Comput Oper Res. 2019;104:295\u2013303.","journal-title":"Comput Oper Res"},{"key":"2226_CR16","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T. Iterated local search. In: Handbook of metaheuristics. Cham: Springer; 2003. p. 320\u201353."},{"key":"2226_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-91086-4_5","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2019","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T. Iterated local search: framework and applications. In: Handbook of metaheuristics. Cham: Springer; 2019. p. 129\u201368."},{"key":"2226_CR18","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cie.2017.09.029","volume":"113","author":"D Matic","year":"2017","unstructured":"Matic D, Kratica J, Maksimovic Z. Solving the minimum edge-dilation k-center problem by genetic algorithms. Comput Ind Eng. 2017;113:282\u201393.","journal-title":"Comput Ind Eng"},{"key":"2226_CR19","doi-asserted-by":"crossref","unstructured":"Moy J. Ospf version 2, ietf rfc 2328. 1998. http:\/\/www.ietf.org\/rfc.","DOI":"10.17487\/rfc2328"},{"key":"2226_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100888","volume":"64","author":"E Osaba","year":"2021","unstructured":"Osaba E, Villar-Rodriguez E, Del Ser J, Nebro AJ, Molina D, LaTorre A, Suganthan PN, Coello C, Herrera F. A tutorial on the design, experimentation and application of metaheuristic algorithms to real-world optimization problems. Swarm Evolut Comput. 2021;64: 100888.","journal-title":"Swarm Evolut Comput"},{"issue":"3","key":"2226_CR21","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg D, Upfal E. A trade-off between space and efficiency for routing tables. J ACM (JACM). 1989;36(3):510\u201330.","journal-title":"J ACM (JACM)"},{"key":"2226_CR22","doi-asserted-by":"crossref","unstructured":"Roditty L, Tov R. New routing techniques and their applications. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015, pp. 23\u201332.","DOI":"10.1145\/2767386.2767409"},{"key":"2226_CR23","doi-asserted-by":"crossref","unstructured":"Thorup M, Zwick U. Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001.","DOI":"10.1145\/378580.378581"},{"key":"2226_CR24","unstructured":"Wilcoxon F. Wilcoxon signed-rank test calculator. 1945. https:\/\/www.socscistatistics.com\/tests\/signedranks\/default2.aspx."},{"issue":"4","key":"2226_CR25","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1007\/s10878-017-0183-4","volume":"36","author":"Y Xu","year":"2018","unstructured":"Xu Y, Peng J, Xu Y. The mixed center location problem. J Comb Optim. 2018;36(4):1128\u201344.","journal-title":"J Comb Optim"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-023-02226-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-023-02226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:39:23Z","timestamp":1730313563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-023-02226-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,12]]},"references-count":25,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["2226"],"URL":"https:\/\/doi.org\/10.1007\/s42979-023-02226-w","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,12]]},"assertion":[{"value":"10 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"781"}}