@InProceedings{gupta_et_al:LIPIcs.APPROX/RANDOM.2023.12,
author = {Gupta, Anupam and Kumar, Amit and Panigrahi, Debmalya},
title = {{Efficient Algorithms and Hardness Results for the Weighted k-Server Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {12:1--12:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.12},
URN = {urn:nbn:de:0030-drops-188375},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.12},
annote = {Keywords: Online Algorithms, Weighted k-server, Integrality Gap, Hardness}
}