Resource Allocation in Bounded Degree Trees

DOI10.1007/11841036_9MaRDI QIDQ5449517zbMATH OpenOpenAlexFDO

Authors Michael Beder, Yuval Cohen, Reuven Bar-Yehuda, Dror Rawitz

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11841036_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Resource allocation in bounded degree trees
• A unified approach to approximating resource allocation and scheduling
• Flexible bandwidth assignment with application to optical networks
• Flexible Bandwidth Assignment with Application to Optical Networks
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions

Cited in

(10)

• Resource allocation in bounded degree trees
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• Distributed algorithms for scheduling on line and tree networks
• Cost allocation in asymmetric trees
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation
• On Lagrangian Relaxation and Subset Selection Problems
• Constant-competitive tree node assignment
• Allocating Bandwidth for Bursty Connections
• Unsplittable flow on a short path

This page was built for publication: Resource Allocation in Bounded Degree Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449517)