Approximating (k, ℓ)-center clustering for curves

DOI10.1137/1.9781611975482.181zbMath1432.68499arXiv1805.01547OpenAlexW2810764694MaRDI QIDQ5236374

Martijn Struijs, Michael Horton, Kevin Buchin, Maarten Löffler, Joachim Gudmundsson, Anne Driemel, Irina Kostitsyna

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.01547

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (6)

Approximating ( k,ℓ )-Median Clustering for Polygonal Curves ⋮ Fréchet Distance for Uncertain Curves ⋮ Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance ⋮ Unnamed Item ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance

This page was built for publication: Approximating (k, ℓ)-center clustering for curves