Constant-competitive tree node assignment
From MaRDI portal
Recommendations
- Optimal node ranking of trees
- Dynamic and static algorithms for optimal placement of resources in a tree
- Online tree node assignment with resource augmentation
- Online Tree Node Assignment with Resource Augmentation
- Optimal node ranking of tree in linear time
- Competitive decision algorithm for the degree-constrained minimum spanning tree
- Resource allocation in bounded degree trees
- Resource Allocation in Bounded Degree Trees
- Efficient algorithms for a constrained k-tree core problem in a tree network
- Continuous bottleneck tree partitioning problems
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- A constant-competitive algorithm for online OVSF code assignment
- A fast storage allocator
- An algorithmic view on OVSF code assignment
- Computing and Combinatorics
- Fast allocation and deallocation with an improved buddy system
- Greedy online frequency allocation in cellular networks
- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
- Online OVSF Code Assignment with Resource Augmentation
- Online tree node assignment with resource augmentation
- Subcube allocation in hypercube computers
Cited in
(4)
This page was built for publication: Constant-competitive tree node assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391778)
