Related references
Note: Only part of the references are listed.Fusible HSTs and the randomized k-server conjecture
James R. Lee
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2018)
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
Nikhil Bansal et al.
JOURNAL OF THE ACM (2015)
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
Noa Avigdor-Elgrabli et al.
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I (2015)
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms
Niv Buchbinder et al.
OPERATIONS RESEARCH (2013)
An Optimal Randomized Online Algorithm for Reordering Buffer Management
Noa Avigdor-Elgrabli et al.
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2013)
Improved Algorithms for Orienteering and Related Problems
Chandra Chekuri et al.
ACM TRANSACTIONS ON ALGORITHMS (2012)
A Primal-Dual Randomized Algorithm for Weighted Paging
Nikhil Bansal et al.
JOURNAL OF THE ACM (2012)
On approximating a geometric prize-collecting traveling salesman problem with time windows
R Bar-Yehuda et al.
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2005)
On-line algorithms for the dynamic traveling repair problem
S Irani et al.
JOURNAL OF SCHEDULING (2004)
On the competitive ratio of the work function algorithm for the k-server problem
Y Bartal et al.
THEORETICAL COMPUTER SCIENCE (2004)
A tight bound on approximating arbitrary metrics by tree metrics
J Fakcharoenphol et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2004)
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
Y Karuno et al.
DISCRETE APPLIED MATHEMATICS (2003)
Dynamic TCP acknowledgment and other stories about e/(e-1)
AR Karlin et al.
ALGORITHMICA (2003)
Randomized weighted caching with two page weights
S Irani
ALGORITHMICA (2002)
Algorithms for the on-line travelling salesman
G Ausiello et al.
ALGORITHMICA (2001)
On-line analysis of the TCP acknowledgment delay problem
DR Dooly et al.
JOURNAL OF THE ACM (2001)
Competitive analysis of randomized paging algorithms
D Achlioptas et al.
THEORETICAL COMPUTER SCIENCE (2000)
Share Paper
