Randomized priority algorithms
Theoretical Computer Science
Offline and online facility leasing
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Online clustering with variable sized clusters
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Online and incremental algorithms for facility location
ACM SIGACT News
Memoryless facility location in one pass
ACM Transactions on Algorithms (TALG)
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Winner-imposing strategyproof mechanisms for multiple Facility Location games
Theoretical Computer Science
| Hi-index | 0.01 |
We consider the problem of Online Facility Location, where the demand points arrive online and must be assigned irrevocably to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We prove that the competitive ratio for Online Facility Location is Θ $(\frac{\log n}{\log\log n})$. On the negative side, we show that no randomized algorithm can achieve a competitive ratio better than Ω $(\frac{\log n}{\log\log n})$ against an oblivious adversary even if the demands lie on a line segment. On the positive side, we present a deterministic algorithm which achieves a competitive ratio of $\mathrm{O}(\frac{\log n}{\log\log n})$ in every metric space.