Efficiently approximating color-spanning balls
From MaRDI portal
Publication:284593
DOI10.1016/j.tcs.2016.04.022zbMath1339.68272OpenAlexW2361557697MaRDI QIDQ284593
Mohammad Reza Kazemi, Mohammad Ali Abam, Ali Mohades, Payam Khanteimouri
Publication date: 18 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.022
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
On approximability of minimum color-spanning ball in high dimensions ⋮ Approximation algorithms for color spanning diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On enclosing k points by a circle
- Shortest color-spanning intervals
- The upper envelope of Voronoi surfaces and its applications
- A near-linear algorithm for the planar 2-center problem
- Which problems have strongly exponential complexity?
- A simple randomized sieve algorithm for the closest-pair problem
- Computing the Smallest Color-Spanning Axis-Parallel Square
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Generalized Selection and Ranking: Sorted Matrices
- On the rectangularp-center problem
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Faster core-set constructions and data stream algorithms in fixed dimensions
- On the complexity of \(k\)-SAT
