Resource allocation in bounded degree trees

DOI10.1007/S00453-007-9121-7MaRDI QIDQ1024215zbMATH OpenOpenAlexFDO

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

Publication date 16 June 2009

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9121-7

zbMATH Keywords

approximation algorithmsschedulingbandwidth allocationstorage allocationbounded degree trees

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
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• Discrete resource allocation with tree constraints by an incremental method
• Multisorted tree-algebras for hierarchical resources allocation
• Dynamic and static algorithms for optimal placement of resources in a tree
• Optimal placement of identical resources in a tree
• Resource allocation in rooted trees for VLSI applications
• Bird's tree allocations revisited
• Tree-Width and Optimization in Bounded Degree Graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3869066 (Why is no real title available?)
• scientific article; zbMATH DE number 1305512 (Why is no real title available?)
• scientific article; zbMATH DE number 1947047 (Why is no real title available?)
• scientific article; zbMATH DE number 2038727 (Why is no real title available?)
• scientific article; zbMATH DE number 2080220 (Why is no real title available?)
• scientific article; zbMATH DE number 2086936 (Why is no real title available?)
• OPTVersusLOADin Dynamic Storage Allocation
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A note on optical routing on trees
• A quasi-PTAS for unsplittable flow on line graphs
• A unified approach to approximating resource allocation and scheduling
• Admission control in networks with advance reservations
• Bandwidth Allocation with Preemption
• Decomposition by clique separators
• Off-line admission control for general scheduling problems
• One for the price of two: a unified approach for approximating covering problems
• Scheduling jobs with fixed start and end times

Cited in

(13)

• Resource Allocation in Bounded Degree Trees
• Constant-competitive tree node assignment
• On Lagrangian relaxation for constrained maximization and reoptimization problems
• Flexible bandwidth assignment with application to optical networks
• A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
• Optimizing bandwidth allocation in elastic optical networks with application to scheduling
• Placing resources in a tree: dynamic and static algorithms
• Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation
• A constant factor approximation algorithm for the storage allocation problem
• Minimax Resource Allocation with Tree Structured Substitutable Resources
• Flexible resource allocation to interval jobs
• Cost allocation in asymmetric trees

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 Q1024215)