TY - GEN
T1 - On the online unit clustering problem
AU - Epstein, Leah
AU - Van Stee, Rob
PY - 2008
Y1 - 2008
N2 - We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh (Proc. Workshop on Approximation and Online Algorithms 2006, LNCS 4368, p.121-131. Springer, 2006). We design a deterministic algorithm with a competitive ratio of 7/4 for the one-dimensional case. This is the first deterministic algorithm that beats the bound of 2. It also has a better competitive ratio than the previous randomized algorithm. Moreover, we provide the first non-trivial deterministic lower bound, improve the randomized lower bound, and prove the first lower bounds for higher dimensions.
AB - We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh (Proc. Workshop on Approximation and Online Algorithms 2006, LNCS 4368, p.121-131. Springer, 2006). We design a deterministic algorithm with a competitive ratio of 7/4 for the one-dimensional case. This is the first deterministic algorithm that beats the bound of 2. It also has a better competitive ratio than the previous randomized algorithm. Moreover, we provide the first non-trivial deterministic lower bound, improve the randomized lower bound, and prove the first lower bounds for higher dimensions.
UR - http://www.scopus.com/inward/record.url?scp=49949092559&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-77918-6_16
DO - 10.1007/978-3-540-77918-6_16
M3 - Conference contribution
AN - SCOPUS:49949092559
SN - 3540779175
SN - 9783540779179
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 193
EP - 206
BT - Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers
T2 - 5th International Workshop on Approximation and Online Algorithms, WAOA 2007
Y2 - 11 October 2007 through 12 October 2007
ER -