Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The (h, k)-Server Problem on Bounded Depth Trees."

Nikhil Bansal et al. (2019)

> Home

Details and statistics

DOI: 10.1145/3301314

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/BansalEJK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/BansalEJK19
Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
The (h, k)-Server Problem on Bounded Depth Trees. ACM Trans. Algorithms 15(2): 28:1-28:26 (2019)

a service of

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.