ESA
2008
Springer
13 years 6 months ago
2008
Springer
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
ESA
1995
Springer
13 years 8 months ago
1995
Springer
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...
ICALP
2007
Springer
13 years 8 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
COCOON
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...