EUVIMEDEUVIMED entdecken
Crossref

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii

Zachary Friggstad, Mahya Jamshidian

Algorithmica · 2026-04 · 88 (2)

DOI: 10.1007/s00453-026-01382-8 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithmica, online erschienen am 31.03.2026. Verfasst von Zachary Friggstad und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Gefördert von: NSERC Discovery Grant, NSERC Discovery Accelerator Supplement Award.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • NSERC Discovery Grant
  • NSERC Discovery Accelerator Supplement Award

Zitieren

APA

Friggstad, Z., & Jamshidian, M. (2026). Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii. Algorithmica, 88(2). https://doi.org/10.1007/s00453-026-01382-8

Vancouver

Friggstad Z, Jamshidian M. Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii. Algorithmica. 2026;88(2). doi:10.1007/s00453-026-01382-8

BibTeX
@article{Friggstad2026,
  author = {Friggstad, Zachary and Jamshidian, Mahya},
  title = {Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii},
  journal = {Algorithmica},
  year = {2026},
  volume = {88},
  number = {2},
  doi = {10.1007/s00453-026-01382-8}
}
Kostenlos starten →