A polylogarithmic-competitive algorithm for the k-server problem

Nikhil Bansal, Niv Buchbinder, Aleksander Ma̧dry, Joseph Naor

Open University of Israel, Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Fingerprint

Dive into the research topics of 'A polylogarithmic-competitive algorithm for the k-server problem'. Together they form a unique fingerprint.

Engineering & Materials Science