"Efficient Algorithms and Hardness Results for the Weighted k-Server Problem."

Anupam Gupta, Amit Kumar, Debmalya Panigrahi (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX/RANDOM.2023.12

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/00010P23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/00010P23
Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM 2023: 12:1-12:19

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.