Approximation algorithms for bandwidth and storage allocation problems under real time constraints

DOI10.1007/3-540-44450-5_33MaRDI QIDQ4472463zbMATH OpenFDO

Authors Andrea Vitaletti, Stefano Leonardi, Alberto Marchetti-Spaccamela

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740409.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Recommendations

• A unified approach to approximating resource allocation and scheduling
• 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
• Approximation algorithms for dynamic storage allocation

Cited in

(10)

• Resource allocation in bounded degree trees
• Flexible bandwidth assignment with application to optical networks
• Flexible resource allocation to interval jobs
• Algorithmic aspects of bandwidth trading
• A competitive scheduling problem and its relevance to UMTS channel assignment
• Algorithmic aspects of bandwidth trading
• A constant factor approximation algorithm for the storage allocation problem
• A unified approach to approximating resource allocation and scheduling
• Resource allocation with time intervals
• Unsplittable flow on a short path

This page was built for publication: Approximation algorithms for bandwidth and storage allocation problems under real time constraints

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