An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Developments from a June 1996 seminar on Online algorithms: the state of the art
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Incremental Clustering and Dynamic Information Retrieval
SIAM Journal on Computing
On-Line Load Balancing of Temporary Tasks on Identical Machines
SIAM Journal on Discrete Mathematics
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics
Bin packing problems with rejection penalties and their dual problems
Information and Computation
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Online Bin Packing with Cardinality Constraints
SIAM Journal on Discrete Mathematics
Online clustering with variable sized clusters
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Better bounds on online unit clustering
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Better bounds on online unit clustering
Theoretical Computer Science
| Hi-index | 5.23 |
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We study several variants and generalizations of the online unit clustering problem, which are inspired by variants of packing and scheduling problems in the literature.