Online unit clustering: Variations on a theme

DOI10.1016/J.TCS.2008.04.046MaRDI QIDQ954982zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clusteringonline algorithmscoloring

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms (68W40) Clustering in the social and behavioral sciences (91C20)

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

Cites work

• scientific article; zbMATH DE number 3769624 (Why is no real title available?)
• scientific article; zbMATH DE number 6469191 (Why is no real title available?)
• A General Approximation Technique for Constrained Forest Problems
• A Randomized Algorithm for Online Unit Clustering
• Algorithms for on-line bin-packing problems with cardinality constraints
• An Improved Algorithm for Online Unit Clustering
• An on-line graph coloring algorithm with sublinear performance ratio
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Bin Packing with Rejection Revisited
• Bin packing problems with rejection penalties and their dual problems
• Capacitated vertex covering
• Dynamic Bin Packing
• Graph Coloring with Rejection
• Incremental Clustering and Dynamic Information Retrieval
• Multiprocessor Scheduling with Rejection
• On the Max Coloring Problem
• On the Online Unit Clustering Problem
• On-Line Load Balancing of Temporary Tasks on Identical Machines
• On-line and first fit colorings of graphs
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Online Bin Packing with Cardinality Constraints
• Speed is as powerful as clairvoyance

Cited in

(12)

• An improved algorithm for online unit clustering
• An improved lower bound for one-dimensional online unit clustering
• Online unit clustering and unit covering in higher dimensions
• Analysis of a first-fit algorithm for the capacitated unit covering problem
• Online unit clustering in higher dimensions
• Online data clustering algorithms in an RTLS system
• An online 2-dimensional clustering problem with variable sized clusters
• Better bounds on online unit clustering
• Online clustering with variable sized clusters
• Online clustering with variable sized clusters
• A Randomized Algorithm for Online Unit Clustering
• On capacitated covering with unit balls

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)