Resource allocation in bounded degree trees

DOI10.1007/s00453-007-9121-7zbMath1171.68026OpenAlexW2005960287MaRDI QIDQ1024215

Dror Rawitz, Michael Beder, Yuval Cohen, 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

schedulingapproximation algorithmsbandwidth allocationstorage allocationbounded degree trees

Mathematics Subject Classification ID

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

Related Items (6)

Flexible bandwidth assignment with application to optical networks ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Optimizing bandwidth allocation in elastic optical networks with application to scheduling ⋮ A constant factor approximation algorithm for the storage allocation problem ⋮ Flexible resource allocation to interval jobs

Cites Work

• A note on optical routing on trees
• Decomposition by clique separators
• Scheduling jobs with fixed start and end times
• Off-line admission control for general scheduling problems
• Admission control in networks with advance reservations
• One for the price of two: a unified approach for approximating covering problems
• A quasi-PTAS for unsplittable flow on line graphs
• Bandwidth Allocation with Preemption
• A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
• OPTVersusLOADin Dynamic Storage Allocation
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A unified approach to approximating resource allocation and scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource allocation in bounded degree trees