Documents A polylog competitive algorithm for the k-server problem Nikhil Bansal (Eindhoven) Niv Buchbinder...

Slide 1 A polylog competitive algorithm for the k-server problem Nikhil Bansal (Eindhoven) Niv Buchbinder (Open Univ., Israel) Aleksander Madry (MIT) Seffi Naor (Technion)…

Documents Hierarchical Well-Separated Trees (HST) Edges’ distances are uniform across a level of the tree...

Hierarchical Well-Separated Trees (HST) Edges’ distances are uniform across a level of the tree Stretch s = factor by which distances decrease from root to leaf Distortion…

Documents Hierarchical Well-Separated Trees (HST)

Hierarchical Well-Separated Trees (HST) Edges’ distances are uniform across a level of the tree Stretch s = factor by which distances decrease from root to leaf Distortion…