Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
From MaRDI portal
Publication:2948466
DOI10.1007/978-3-319-17142-5_17zbMath1459.68234OpenAlexW761131986MaRDI QIDQ2948466
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_17
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Clustering to minimize the maximum intercluster distance
- A subexponential bound for linear programming
- Covering and piercing disks with two centers
- More planar two-center algorithms
- Largest bounding box, smallest diameter, and related problems on imprecise points
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Incremental Clustering and Dynamic Information Retrieval
- The 2-center problem in three dimensions
This page was built for publication: Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls