The (h,k)-server problem on bounded-depth trees.

N. Bansal, M. Elias, L. Jez, G. Koumoutsos

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)
73 Downloads (Pure)

Fingerprint

Dive into the research topics of 'The (h,k)-server problem on bounded-depth trees.'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science