An Efficient Algorithm for 2D Euclidean 2-Center with Outliers

DOI10.1007/978-3-540-87744-8_6zbMath1158.68521arXiv0806.4326OpenAlexW2162317280MaRDI QIDQ3541075

Jeff M. Phillips, Pankaj K. Agarwal

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ On the complexity of some problems of searching for a family of disjoint clusters ⋮ A streaming algorithm for 2-center with outliers in high dimensions ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ An O(n log n)-Time Algorithm for the k-Center Problem in Trees ⋮ An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees ⋮ Unnamed Item ⋮ On the planar two-center problem and circular hulls

This page was built for publication: An Efficient Algorithm for 2D Euclidean 2-Center with Outliers