"On the Advice Complexity of the k-server Problem Under Sparse Metrics."

Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz (2016)

> Home

Details and statistics

DOI: 10.1007/S00224-015-9649-X

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/GuptaKL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/GuptaKL16
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On the Advice Complexity of the k-server Problem Under Sparse Metrics. Theory Comput. Syst. 59(3): 476-499 (2016)

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.