{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T12:10:59Z","timestamp":1774959059130,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSERC Discovery Grant"},{"name":"NSERC Discovery Accelerator Supplement Award"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00453-026-01382-8","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:31:09Z","timestamp":1774956669000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii"],"prefix":"10.1007","volume":"88","author":[{"given":"Zachary","family":"Friggstad","sequence":"first","affiliation":[]},{"given":"Mahya","family":"Jamshidian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,31]]},"reference":[{"key":"1382_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-19094-0_15","volume-title":"WALCOM: Algorithms and Computation","author":"AK Abu-Affash","year":"2011","unstructured":"Abu-Affash, A.K., Carmi, P., Katz, M.J., Morgenstern, G.: Multi cover of a polygon minimizing the sum of areas. In: Katoh, N., Kumar, A. (eds.) WALCOM: Algorithms and Computation, pp. 134\u2013145. Springer, Berlin Heidelberg (2011)"},{"key":"1382_CR2","first-page":"69:1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"S Ahmadian","year":"2016","unstructured":"Ahmadian, S., Swamy, C.: Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of Leibniz International Proceedings in Informatics (LIPIcs), p. 69:1-69:15. Dagstuhl, Germany (2016) . (Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik)"},{"key":"1382_CR3","first-page":"15:1","volume-title":"27th International Symposium on Algorithms and Computation (ISAAC 2016), volume 64 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"S Bandyapadhyay","year":"2016","unstructured":"Bandyapadhyay, S., Varadarajan, K.: Approximate Clustering via Metric Partitioning. In: Hong, S.-H. (ed.) 27th International Symposium on Algorithms and Computation (ISAAC 2016), volume 64 of Leibniz International Proceedings in Informatics (LIPIcs), p. 15:1-15:13. Dagstuhl, Germany (2016) . (Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik)"},{"key":"1382_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-ptas for unsplittable flow on line graphs. In: Proceedings of 38th Annual Symposium on Theory of Computing (STOC), STOC \u201906, page 721\u2013729. Association for Computing Machinery (2006)","DOI":"10.1145\/1132516.1132617"},{"key":"1382_CR5","doi-asserted-by":"crossref","unstructured":"Batra, J., Garg, N., Kumar, A., Momke, T., Wiese, A.: New approximation schemes for unsplittable flow on a path. In: Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 47\u201358 (2015)","DOI":"10.1137\/1.9781611973730.5"},{"issue":"1","key":"1382_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00453-014-9907-3","volume":"73","author":"B Behsaz","year":"2015","unstructured":"Behsaz, B., Salavatipour, M.R.: On minimum sum of radii and diameters clustering. Algorithmica 73(1), 143\u2013165 (2015)","journal-title":"Algorithmica"},{"key":"1382_CR7","unstructured":"Bhowmick, S., Inamdar, T., Varadarajan, K.: On metric multi-covering problems (2017)"},{"key":"1382_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-020-00762-y","volume":"83","author":"S Bhowmick","year":"2021","unstructured":"Bhowmick, S., Inamdar, T., Varadarajan, K.R.: Fault-tolerant covering problems in metric spaces. Algorithmica 83, 413\u2013446 (2021)","journal-title":"Algorithmica"},{"key":"1382_CR9","doi-asserted-by":"crossref","unstructured":"Bhowmick, S., Varadarajan, K., Xue, S.-K.: A constant-factor approximation for multi-covering with disks. SoCG \u201913, page 243\u2013248, New York, NY, USA, 2013. Association for Computing Machinery","DOI":"10.1145\/2462356.2462400"},{"key":"1382_CR10","doi-asserted-by":"crossref","unstructured":"Buchem, M., Ettmayr, K., Rosado, H.\u00a0K.\u00a0K., Wiese, A.: A $$(3+\\epsilon )$$-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. In: proceedings of ACM Symposium on Discrete Algorithms (SODA), (2024)","DOI":"10.1137\/1.9781611977912.69"},{"key":"1382_CR11","doi-asserted-by":"crossref","unstructured":"Capoyleas, V., Rote, G., Woeginger, G.: Geometric clusterings, (1990)","DOI":"10.1016\/0196-6774(91)90007-L"},{"key":"1382_CR12","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pages 378\u2013388, (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"issue":"1","key":"1382_CR13","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, E., 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."},{"issue":"2","key":"1382_CR14","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jcss.2003.07.014","volume":"68","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. J. Comput. Syst. Sci. 68(2), 417\u2013441 (2004). (Special Issue on STOC 2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1382_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"F Chudak","year":"2003","unstructured":"Chudak, F., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"1382_CR16","doi-asserted-by":"crossref","unstructured":"Chudak, F., Williamson, D.\u00a0P.: Improved approximation algorithms for capacitated facility location problems. In: Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization, page 99\u2013113. Springer-Verlag, (1999)","DOI":"10.1007\/3-540-48777-8_8"},{"key":"1382_CR17","doi-asserted-by":"crossref","unstructured":"Doddi, S., Marathe, M.\u00a0V., Ravi, S.\u00a0S., Taylor, D.\u00a0S., Widmayer, P.: Approximation algorithms for clustering to minimize the sum of diameters. In: In Proceedings of 7th Scandanavian Workshop on Algorithm Theory (SWAT), page 237\u2013250. Springer-Verlag, (2000)","DOI":"10.1007\/3-540-44985-X_22"},{"issue":"6","key":"1382_CR18","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."},{"key":"1382_CR19","unstructured":"Friggstad, Z., Jamshidian, M.: Approximation algorithms for clustering with minimum sum of radii, diameters, and squared radii. In: In proceedings of the European Sympsium on Algorithms (ESA), (2022)"},{"issue":"3","key":"1382_CR20","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00453-009-9282-7","volume":"57","author":"M Gibson","year":"2009","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I.A., Varadarajan, K.: On metric clustering to minimize the sum of radii. Algorithmica 57(3), 484\u2013498 (2009)","journal-title":"Algorithmica"},{"issue":"1","key":"1382_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/100798144","volume":"41","author":"M Gibson","year":"2012","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I.A., Varadarajan, K.: On clustering to minimize the sum of radii. SIAM J. Comput. 41(1), 47\u201360 (2012)","journal-title":"SIAM J. Comput."},{"key":"1382_CR22","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Momke, T., Wiese, A.: A ptas for unsplittable flow on a path. In: In proceedings of 54th ACM Symposium on Theory of Computing (STOC), (2022)","DOI":"10.1145\/3519935.3519959"},{"key":"1382_CR23","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Momke, T., Wiese, A.: Unsplittable flow on a path: The game! In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 906\u2013926, (2022)","DOI":"10.1137\/1.9781611977073.39"},{"key":"1382_CR24","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Momke, T., Wiese, A., Zhou, A.: To augment or not to augment: Solving unsplittable flow on a path by creating slack. In: Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2411\u20132422 (2017)","DOI":"10.1137\/1.9781611974782.159"},{"key":"1382_CR25","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Momke, T., Wiese, A., Zhou, H.: A (5\/3 + $$\\epsilon $$)-approximation for unsplittable flow on a path: Placing small tasks into boxes. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, page 607\u2013619, New York, NY, USA, 2018. Association for Computing Machinery","DOI":"10.1145\/3188745.3188894"},{"issue":"1","key":"1382_CR26","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"1382_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01896987","volume":"4","author":"P Hansen","year":"1987","unstructured":"Hansen, P., Jaumard, B.: Minimum sum of diameters clustering. J. Classif. 4(2), 215\u2013226 (1987)","journal-title":"J. Classif."},{"issue":"24","key":"1382_CR28","doi-asserted-by":"publisher","first-page":"3267","DOI":"10.1016\/j.disc.2006.06.013","volume":"306","author":"P Heggernes","year":"2006","unstructured":"Heggernes, P., Lokshtanov, D.: Optimal broadcast domination in polynomial time. Discret. Math. 306(24), 3267\u20133280 (2006)","journal-title":"Discret. Math."},{"issue":"2","key":"1382_CR29","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":"2","key":"1382_CR30","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 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"1382_CR31","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: The p-medians. SIAM J. Appl. Math. 37(3), 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"1382_CR32","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"issue":"5","key":"1382_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"JH Lin","year":"1992","unstructured":"Lin, J.H., Vitter, J.S.: Approximation algorithms for geometric median problems. Inf. Process. Lett. 44(5), 245\u2013249 (1992)","journal-title":"Inf. Process. Lett."},{"key":"1382_CR34","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, W., Xie, R.: A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. Optimization Letters, (2021)","DOI":"10.1007\/s11590-021-01831-z"},{"key":"1382_CR35","unstructured":"Monma, C.\u00a0L., Suri, S.: Partitioning points and graphs to minimize the maximum or the sum of diameters. Graph Theory, Combinatorics, and Applications, pages 880\u2013912, (1991)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-026-01382-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-026-01382-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-026-01382-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:31:16Z","timestamp":1774956676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-026-01382-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,31]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1382"],"URL":"https:\/\/doi.org\/10.1007\/s00453-026-01382-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,31]]},"assertion":[{"value":"30 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"34"}}