Weighted k-Server Bounds via Combinatorial Dichotomies

Article Details
Title:	Weighted k-Server Bounds via Combinatorial Dichotomies
Article URLs:	https://doi.org/10.1109/FOCS.2017.52 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.52
Alternative Article URLs:
Authors:	Nikhil Bansal	TU Eindhoven
	Marek Eliás	TU Eindhoven
	Grigorios Koumoutsos	TU Eindhoven
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/focs/BansalEK17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017