An improved lower bound for one-dimensional online unit clustering
Theor. Comput. Sci., Volume abs/1502.02422, Issue C, 2015.
We consider the one-dimensional version of the online unit clustering problem, proposed by Chan and Zarrabi-Zadeh (WAOA2007 and Theory of Computing Systems 45(3), 2009), which is defined as follows: \"Points\" are given online on the line one by one. An algorithm creates a \"cluster,\" which is a line segment. The initial length of a clus...More
PPT (Upload PPT)