{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:31:30Z","timestamp":1743039090438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031212024"},{"type":"electronic","value":"9783031212031"}],"license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21203-1_25","type":"book-chapter","created":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:35:25Z","timestamp":1668152125000},"page":"417-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The FastMap Pipeline for\u00a0Facility Location Problems"],"prefix":"10.1007","author":[{"given":"Omkar","family":"Thakoor","sequence":"first","affiliation":[]},{"given":"Ang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Kline","sequence":"additional","affiliation":[]},{"given":"T. K.","family":"Satish Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10852-004-4072-3","volume":"4","author":"A Al-Khedhairi","year":"2005","unstructured":"Al-Khedhairi, A., Salhi, S.: Enhancements to two exact algorithms for solving the vertex $$p$$-center problem. J. Math. Model. Algorithms 4(2), 129\u2013147 (2005). https:\/\/doi.org\/10.1007\/s10852-004-4072-3","journal-title":"J. Math. Model. Algorithms"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 522\u2013539. SIAM (2021)","DOI":"10.1137\/1.9781611976465.32"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jcss.1997.1388","volume":"54","author":"N Alon","year":"1997","unstructured":"Alon, N., Galil, Z., Margalit, O.: On the exponent of the all pairs shortest path problem. J. Comput. Syst. Sci. 54(2), 255\u2013262 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4), 434\u2013449 (1996). https:\/\/doi.org\/10.1007\/BF01940874","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya, V., et al.: Local search heuristics for $$k$$-median and facility location problems. SIAM J. Comput. 33(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"issue":"02","key":"25_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S0218195911003597","volume":"21","author":"P Brass","year":"2011","unstructured":"Brass, P., Knauer, C., Na, H.S., Shin, C.S., Vigneron, A.: The aligned $$k$$-center problem. Int. J. Comput. Geom. Appl. 21(02), 157\u2013178 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"12","key":"25_CR7","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1016\/j.cor.2013.07.011","volume":"40","author":"H Calik","year":"2013","unstructured":"Calik, H., Tansel, B.C.: Double bound method for solving the $$p$$-center location problem. Comput. Oper. Res. 40(12), 2991\u20132999 (2013)","journal-title":"Comput. Oper. Res."},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-59250-3_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Chakrabarty","year":"2017","unstructured":"Chakrabarty, D., Krishnaswamy, R., Kumar, A.: The heterogeneous capacitated k-center problem. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 123\u2013135. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_11"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 590\u2013598. Association for Computing Machinery (2007)","DOI":"10.1145\/1250790.1250877"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the $$k$$-median problem. J. Comput. Syst. Sci. 65(1), 129\u2013149 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-31594-7_17","volume-title":"Automata, Languages, and Programming","author":"M Charikar","year":"2012","unstructured":"Charikar, M., Li, S.: A dependent lp-rounding approach for the k-median problem. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 194\u2013205. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_17"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","volume":"65","author":"S Chaudhuri","year":"1998","unstructured":"Chaudhuri, S., Garg, N., Ravi, R.: The $$p$$-neighbor $$k$$-center problem. Inf. Process. Lett. 65(3), 131\u2013134 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","volume":"36","author":"D Chen","year":"2009","unstructured":"Chen, D., Chen, R.: New relaxation-based algorithms for the optimal solution of the continuous and discrete $$p$$-center problems. Comput. Oper. Res. 36(5), 1646\u20131655 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2005.09.009","volume":"97","author":"M Chrobak","year":"2006","unstructured":"Chrobak, M., Kenyon, C., Young, N.: The reverse greedy algorithm for the metric $$k$$-median problem. Inf. Process. Lett. 97(2), 68\u201372 (2006)","journal-title":"Inf. Process. Lett."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Cohen, L., Uras, T., Jahangiri, S., Arunasalam, A., Koenig, S., Kumar, T.K.S.: The FastMap algorithm for shortest path computations. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (2018)","DOI":"10.24963\/ijcai.2018\/198"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.11.006","volume":"103","author":"C Contardo","year":"2019","unstructured":"Contardo, C., Iori, M., Kramer, R.: A scalable exact algorithm for the vertex $$p$$-center problem. Comput. Oper. Res. 103, 211\u2013220 (2019)","journal-title":"Comput. Oper. Res."},{"key":"25_CR17","unstructured":"Cornu\u00e9jols, G., Nemhauser, G., Wolsey, L.: The Uncapacitated Facility Location Problem. Cornell University Operations Research and Industrial Engineering, Technical report (1983)"},{"issue":"9","key":"25_CR18","first-page":"428","volume":"45","author":"MS Daskin","year":"2000","unstructured":"Daskin, M.S.: A new approach to solving the vertex $$p$$-center problem to optimality: algorithm and computational results. Commun. Oper. Res. Soc. Japan 45(9), 428\u2013436 (2000)","journal-title":"Commun. Oper. Res. Soc. Japan"},{"issue":"10","key":"25_CR19","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. 38(10), 1367\u20131376 (2011)","journal-title":"Comput. Oper. Res."},{"key":"25_CR20","unstructured":"Dohan, D., Karp, S., Matejek, B.: K-median Algorithms: Theory in practice. Princeton University Computer Science, Technical report (2015)"},{"issue":"6","key":"25_CR21","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(6), 285\u2013288 (1985)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","volume":"16","author":"S Elloumi","year":"2004","unstructured":"Elloumi, S., Labb\u00e9, M., Pochet, Y.: A new formulation and resolution method for the $$p$$-center problem. INFORMS J. Comput. 16(1), 84\u201394 (2004)","journal-title":"INFORMS J. Comput."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Lin, K.I.: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (1995)","DOI":"10.1145\/223784.223812"},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts. Algorithms and Case Studies. Springer Science & Business Media, Models (2009). https:\/\/doi.org\/10.1007\/978-3-7908-2151-2","DOI":"10.1007\/978-3-7908-2151-2"},{"issue":"6","key":"25_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M Fredman","year":"1976","unstructured":"Fredman, M.: New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 83\u201389 (1976)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR27","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"25_CR28","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1006\/jcss.1997.1385","volume":"54","author":"Z Galil","year":"1997","unstructured":"Galil, Z., Margalit, O.: All pairs shortest paths for graphs with small integer length edges. J. Comput. Syst. Sci. 54(2), 243\u2013254 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"25_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jcom.1993.1014","volume":"9","author":"Z Galil","year":"1993","unstructured":"Galil, Z., Margalit, O.: Witnesses for boolean matrix multiplication and for transitive closure. J. Complex. 9(2), 201\u2013221 (1993)","journal-title":"J. Complex."},{"issue":"5","key":"25_CR30","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10732-017-9345-x","volume":"23","author":"J Garcia-Diaz","year":"2017","unstructured":"Garcia-Diaz, J., Sanchez-Hernandez, J., Menchaca-Mendez, R., Menchaca-Mendez, R.: When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex $$k$$-center problem. J. Heuristics 23(5), 349\u2013366 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9345-x","journal-title":"J. Heuristics"},{"key":"25_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR32","unstructured":"Gopalakrishnan, S., Cohen, L., Koenig, S., Kumar, T.K.S.: Embedding directed graphs in potential fields using FastMap-D. In: Proceedings of the 13th International Symposium on Combinatorial Search (2020)"},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0304-3975(98)00063-2","volume":"207","author":"L Guo-Hui","year":"1998","unstructured":"Guo-Hui, L., Xue, G.: $$k$$-center and $$k$$-median problems in graded distances. Theoret. Comput. Sci. 207(1), 181\u2013192 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45022-X_7","volume-title":"Automata, Languages and Programming","author":"T Hagerup","year":"2000","unstructured":"Hagerup, T.: Improved shortest paths on the word RAM. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 61\u201372. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_7"},{"key":"25_CR35","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-31155-0_12","volume":"38\u201341","author":"Y Han","year":"2016","unstructured":"Han, Y., Takaoka, T.: An $$o(n^3\\log \\log n\/\\log ^2 n)$$ time algorithm for all pairs shortest paths. J. Discrete Algorithms 38\u201341, 9\u201319 (2016). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_12","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"25_CR36","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."},{"issue":"4","key":"25_CR37","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10732-014-9277-7","volume":"22","author":"CA Irawan","year":"2016","unstructured":"Irawan, C.A., Salhi, S., Drezner, Z.: Hybrid meta-heuristics with vns and exact methods: application to large unconditional and conditional vertex $$p$$-centre problems. J. Heuristics 22(4), 507\u2013537 (2016). https:\/\/doi.org\/10.1007\/s10732-014-9277-7","journal-title":"J. Heuristics"},{"issue":"6","key":"25_CR38","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. J. ACM (JACM) 50(6), 795\u2013824 (2003)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"25_CR39","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$-median problems using the primal-dual schema and lagrangian relaxation. J. ACM (JACM) 48(2), 274\u2013296 (2001)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"25_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM (JACM) 24(1), 1\u201313 (1977)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"25_CR41","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.scient.2011.07.010","volume":"18","author":"A Kaveh","year":"2011","unstructured":"Kaveh, A., Nasr, H.: Solving the conditional and unconditional $$p$$-center problem with modified harmony search: a real case study. Sci. Iranica 18(4), 867\u2013877 (2011)","journal-title":"Sci. Iranica"},{"issue":"1\u20132","key":"25_CR42","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.J.: Fault tolerant $$k$$-center problems. Theoret. Comput. Sci. 242(1\u20132), 237\u2013245 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"25_CR43","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated $$k$$-center problem. SIAM J. Discret. Math. 13(3), 403\u2013418 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"25_CR44","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. 32(5), 491\u2013495 (2004)","journal-title":"Oper. Res. Lett."},{"key":"25_CR45","doi-asserted-by":"publisher","unstructured":"Li, A., Stuckey, P., Koenig, S., Kumar, T.K.S.: A FastMap-based algorithm for block modeling. In: Proceedings of the International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (2022). https:\/\/doi.org\/10.1007\/978-3-031-08011-1_16","DOI":"10.1007\/978-3-031-08011-1_16"},{"key":"25_CR46","unstructured":"Li, J., Felner, A., Koenig, S., Kumar, T.K.S.: Using FastMap to solve graph problems in a Euclidean space. In: Proceedings of the International Conference on Automated Planning and Scheduling (2019)"},{"issue":"2","key":"25_CR47","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/130938645","volume":"45","author":"S Li","year":"2016","unstructured":"Li, S., Svensson, O.: Approximating $$k$$-median via pseudo-approximation. SIAM J. Comput. 45(2), 530\u2013547 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR48","first-page":"48","volume":"42","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107, N., Labb\u00e9, M., Hansen, P.: Solving the $$p$$-center problem with tabu search and variable neighborhood search. Netw. Int. J. 42(1), 48\u201364 (2003)","journal-title":"Netw. Int. J."},{"issue":"5","key":"25_CR49","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1016\/j.cor.2004.09.035","volume":"33","author":"FA \u00d6zsoy","year":"2006","unstructured":"\u00d6zsoy, F.A., P\u0131nar, M.\u00c7.: An exact algorithm for the capacitated vertex $$p$$-center problem. Comput. Oper. Res. 33(5), 1420\u20131436 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"25_CR50","doi-asserted-by":"publisher","first-page":"3075","DOI":"10.1016\/j.cor.2004.04.009","volume":"32","author":"JA Pacheco","year":"2005","unstructured":"Pacheco, J.A., Casado, S.: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case. Comput. Oper. Res. 32(12), 3075\u20133091 (2005)","journal-title":"Comput. Oper. Res."},{"key":"25_CR51","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2014)","DOI":"10.1145\/2623330.2623732"},{"issue":"3","key":"25_CR52","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 problems in graphs. Discret. Appl. Math. 17(3), 263\u2013268 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"25_CR53","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1162\/evco.2008.16.3.417","volume":"16","author":"W Pullan","year":"2008","unstructured":"Pullan, W.: A memetic genetic algorithm for the vertex $$p$$-center problem. Evol. Comput. 16(3), 417\u2013436 (2008)","journal-title":"Evol. Comput."},{"issue":"2","key":"25_CR54","first-page":"527","volume":"1","author":"R Rana","year":"2008","unstructured":"Rana, R., Garg, D.: The analytical study of $$k$$-center problem solving techniques. Int. J. Inf. Technol. Knowl. Manag. 1(2), 527\u2013535 (2008)","journal-title":"Int. J. Inf. Technol. Knowl. Manag."},{"key":"25_CR55","unstructured":"Rdusseeun, L., Kaufman, P.: Clustering by means of medoids. In: Proceedings of the Statistical Data Analysis Based on the L1 Norm Conference, Neuchatel, Switzerland, pp. 405\u2013416 (1987)"},{"issue":"3","key":"25_CR56","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2498\/cit.2005.03.05","volume":"13","author":"B Robi\u010d","year":"2005","unstructured":"Robi\u010d, B., Miheli\u010d, J.: Solving the $$k$$-center problem efficiently with a dominating set algorithm. J. Comput. Inf. Technol. 13(3), 225\u2013234 (2005)","journal-title":"J. Comput. Inf. Technol."},{"key":"25_CR57","doi-asserted-by":"crossref","unstructured":"Schubert, E., Rousseeuw, P.J.: Fast and eager k-medoids clustering: O(k) runtime improvement of the pam, clara, and clarans algorithms. Inf. Syst. 101, 101804 (2021)","DOI":"10.1016\/j.is.2021.101804"},{"issue":"3","key":"25_CR58","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jcss.1995.1078","volume":"51","author":"R Seidel","year":"1995","unstructured":"Seidel, R.: On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51(3), 400\u2013403 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR59","first-page":"355","volume":"20","author":"DB Shmoys","year":"1995","unstructured":"Shmoys, D.B.: Computing near-optimal solutions to combinatorial optimization problems. Comb. Optim. 20, 355\u2013397 (1995)","journal-title":"Comb. Optim."},{"issue":"4","key":"25_CR60","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(92)90200-F","volume":"43","author":"T Takaoka","year":"1992","unstructured":"Takaoka, T.: A new upper bound on the complexity of the all pairs shortest path problem. Inf. Process. Lett. 43(4), 195\u2013199 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"25_CR61","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M Thorup","year":"1999","unstructured":"Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM (JACM) 46(3), 362\u2013394 (1999)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"25_CR62","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1006\/jagm.2000.1080","volume":"35","author":"M Thorup","year":"2000","unstructured":"Thorup, M.: Floats, integers, and single source shortest paths. J. Algorithms 35(2), 189\u2013201 (2000)","journal-title":"J. Algorithms"},{"issue":"2","key":"25_CR63","first-page":"95","volume":"21","author":"R Whitaker","year":"1983","unstructured":"Whitaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR Inf. Syst. Oper. Res. 21(2), 95\u2013108 (1983)","journal-title":"INFOR Inf. Syst. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2022: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21203-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T21:03:20Z","timestamp":1668287000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21203-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"ISBN":["9783031212024","9783031212031"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21203-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"12 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valencia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2022.webs.upv.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 (demo paper)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}