ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: The (h, k)-Server Problem on Bounded Depth Trees
Article URLs:
Alternative Article URLs:
Authors: Nikhil Bansal
  • TU Eindhoven
Marek Eliás
  • TU Eindhoven
Lukasz Jez
  • University of Wroclaw
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/soda/BansalEJK17
Author Comments:

Discuss this paper and its artifacts below