Resource allocation in bounded degree trees
From MaRDI portal
Publication:1024215
DOI10.1007/S00453-007-9121-7zbMATH Open1171.68026OpenAlexW2005960287MaRDI QIDQ1024215FDOQ1024215
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
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
Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Decomposition by clique separators
- Scheduling jobs with fixed start and end times
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A note on optical routing on trees
- Title not available (Why is that?)
- A unified approach to approximating resource allocation and scheduling
- Title not available (Why is that?)
- One for the price of two: a unified approach for approximating covering problems
- Off-line admission control for general scheduling problems
- A quasi-PTAS for unsplittable flow on line graphs
- Admission control in networks with advance reservations
- Title not available (Why is that?)
- Title not available (Why is that?)
- OPTVersusLOADin Dynamic Storage Allocation
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bandwidth Allocation with Preemption
Cited In (13)
- Constant-competitive tree node assignment
- Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- Flexible resource allocation to interval jobs
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- Cost allocation in asymmetric trees
- Resource Allocation in Bounded Degree Trees
- Flexible bandwidth assignment with application to optical networks
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling
- Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
- Placing resources in a tree: dynamic and static algorithms
- A constant factor approximation algorithm for the storage allocation problem
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)
