Flexible bandwidth assignment with application to optical networks
DOI10.1007/s10951-017-0514-4zbMath1406.90047OpenAlexW2592580506MaRDI QIDQ1617285
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Publication date: 7 November 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-017-0514-4
Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Caching is hard -- even in the fault model
- Resource allocation in bounded degree trees
- One for the price of two: a unified approach for approximating covering problems
- Profit Maximization in Flex-Grid All-Optical Networks
- A quasi-PTAS for unsplittable flow on line graphs
- An improved approximation algorithm for resource allocation
- A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
- Multicommodity demand flow in a tree and packing integer programs
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A unified approach to approximating resource allocation and scheduling
This page was built for publication: Flexible bandwidth assignment with application to optical networks