The (H, K)-Server Problem on Bounded Depth Trees

doi 10.1137/1.9781611974782.65
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Rubel's Problem on Bounded Analytic Functions

Annales Academiae Scientiarum Fennicae Mathematica
Mathematics
2016English

On Improving Matchings in Trees, via Bounded-Length Augmentations

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

On the Bounded-Hop MST Problem on Random Euclidean Instances

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

Drawing Ordered (K − 1)–Ary Trees on K–Grids

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Ramsey Goodness of Bounded Degree Trees

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2018English

The L(h, K)-Labelling Problem: An Updated Survey and Annotated Bibliography

Computer Journal
Computer Science
2011English

A New Approach to the Server Problem

SIAM Journal on Discrete Mathematics
Mathematics
1991English

The Existence of Bounded Harmonic Functions on C-H Manifolds

Bulletin of the Australian Mathematical Society
Mathematics
1996English

How to Visualize the K-Root Name Server

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy