Online unit clustering: Variations on a theme
From MaRDI portal
Publication:954982
DOI10.1016/J.TCS.2008.04.046zbMATH Open1152.68060OpenAlexW2095128928MaRDI QIDQ954982FDOQ954982
Authors: Leah Epstein, Asaf Levin, Rob van Stee 
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.046
Recommendations
- On the Online Unit Clustering Problem
- On the online unit clustering problem
- Online unit clustering in higher dimensions
- An Improved Algorithm for Online Unit Clustering
- An improved algorithm for online unit clustering
- A randomized algorithm for online unit clustering
- A Randomized Algorithm for Online Unit Clustering
- Better bounds on online unit clustering
- Better bounds on online unit clustering
- Online unit clustering and unit covering in higher dimensions
Pattern recognition, speech recognition (68T10) Analysis of algorithms (68W40) Clustering in the social and behavioral sciences (91C20)
Cites Work
- Speed is as powerful as clairvoyance
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- A General Approximation Technique for Constrained Forest Problems
- Title not available (Why is that?)
- Capacitated vertex covering
- Multiprocessor Scheduling with Rejection
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Algorithms for on-line bin-packing problems with cardinality constraints
- Dynamic Bin Packing
- Online Bin Packing with Cardinality Constraints
- On-line and first fit colorings of graphs
- An on-line graph coloring algorithm with sublinear performance ratio
- Incremental Clustering and Dynamic Information Retrieval
- On the Online Unit Clustering Problem
- A Randomized Algorithm for Online Unit Clustering
- On the Max Coloring Problem
- Title not available (Why is that?)
- On-Line Load Balancing of Temporary Tasks on Identical Machines
- Bin packing problems with rejection penalties and their dual problems
- Bin Packing with Rejection Revisited
- An Improved Algorithm for Online Unit Clustering
- Graph Coloring with Rejection
Cited In (12)
- Online data clustering algorithms in an RTLS system
- An online 2-dimensional clustering problem with variable sized clusters
- A Randomized Algorithm for Online Unit Clustering
- An improved algorithm for online unit clustering
- Analysis of a first-fit algorithm for the capacitated unit covering problem
- Online unit clustering and unit covering in higher dimensions
- Online unit clustering in higher dimensions
- Online clustering with variable sized clusters
- Online clustering with variable sized clusters
- On capacitated covering with unit balls
- An improved lower bound for one-dimensional online unit clustering
- Better bounds on online unit clustering
This page was built for publication: Online unit clustering: Variations on a theme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954982)
