Anupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi. Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
Abstract is missing.