A randomized algorithm for online unit clustering
From MaRDI portal
Publication:839627
DOI10.1007/S00224-007-9085-7zbMATH Open1187.68701OpenAlexW1976011284MaRDI QIDQ839627FDOQ839627
Authors: Timothy M. Chan, Hamid Zarrabi-Zadeh 
Publication date: 2 September 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9085-7
Recommendations
Cites Work
- Introduction to algorithms
- Clustering to minimize the maximum intercluster distance
- Title not available (Why is that?)
- On the Complexity of Some Common Geometric Location Problems
- Approximation schemes for covering and packing problems in image processing and VLSI
- On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
- Title not available (Why is that?)
- On-line and first fit colorings of graphs
- Automata, Languages and Programming
- Optimal packing and covering in the plane are NP-complete
- Simple heuristics for unit disk graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Incremental Clustering and Dynamic Information Retrieval
- Label placement by maximum independent set in rectangles
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Better streaming algorithms for clustering problems
- Approximation and Online Algorithms
Cited In (17)
- An online 2-dimensional clustering problem with variable sized clusters
- A Randomized Algorithm for Online Unit Clustering
- Online unit clustering: Variations on a theme
- An improved algorithm for online unit clustering
- Online weight balancing on the unit circle
- Online unit clustering and unit covering in higher dimensions
- Online unit clustering in higher dimensions
- Online class cover problem
- Online clustering with variable sized clusters
- A new model for the linear 1-dimensional online clustering problem
- Online geometric covering and piercing
- A competitive strategy for distance-aware online shape allocation
- Online sum-radii clustering
- An Improved Algorithm for Online Unit Clustering
- An improved lower bound for one-dimensional online unit clustering
- Online coloring a token graph
- Better bounds on online unit clustering
This page was built for publication: A randomized algorithm for online unit clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839627)
