"A new upper bound on the work function algorithm for the k-server problem."

Wenming Zhang, Yongxi Cheng (2020)

> Home

Details and statistics

DOI: 10.1007/S10878-019-00493-Z

access: closed

type: Journal Article

metadata version: 2020-02-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/ZhangC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/ZhangC20
Wenming Zhang, Yongxi Cheng:
A new upper bound on the work function algorithm for the k-server problem. J. Comb. Optim. 39(2): 509-518 (2020)

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.