Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
DOI10.1007/978-3-319-17142-5_17zbMATH Open1459.68234OpenAlexW761131986MaRDI QIDQ2948466FDOQ2948466
Authors: Wanbin Son, Peyman Afshani 
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
Recommendations
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Streaming with minimum space: an algorithm for covering by two congruent balls
- An improved interactive streaming algorithm for the distinct elements problem
- Streaming Algorithms for Independent Sets
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular matroid intersection
- Streaming algorithms for planar convex hulls
- On streaming algorithms for geometric independent set and clique
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Clustering to minimize the maximum intercluster distance
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- A subexponential bound for linear programming
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- Title not available (Why is that?)
- Incremental Clustering and Dynamic Information Retrieval
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Title not available (Why is that?)
- More planar two-center algorithms
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Covering and piercing disks with two centers
- The 2-center problem in three dimensions
Cited In (8)
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Streaming Algorithms for Independent Sets
- Computing \(k\)-center over streaming data for small \(k\)
- From approximate balls to approximate ellipses
- Approximate ellipsoid in the streaming model
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
This page was built for publication: Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948466)
