Approximation algorithms for the unsplittable flow problem
From MaRDI portal
Publication:868438
DOI10.1007/s00453-006-1210-5zbMath1107.68120OpenAlexW2104685111MaRDI QIDQ868438
Amit Chakrabarti, Amit Kumar, Chandra Chekuri, Anupam Gupta
Publication date: 5 March 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Approximation_Algorithms_for_the_Unsplittable_Flow_Problem/6603611
Related Items (21)
Improved algorithms for resource allocation under varying capacity ⋮ Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Submodular Unsplittable Flow on Trees ⋮ Optimal interval scheduling with a resource constraint ⋮ Resource allocation with time intervals ⋮ Unnamed Item ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ Algebraic theory on shortest paths for all flows ⋮ Scheduling split intervals with non-uniform demands ⋮ Complex-demand scheduling problem with application in smart grid ⋮ Stochastic Unsplittable Flows ⋮ A constant factor approximation algorithm for the storage allocation problem ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ Unnamed Item ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ The Prize-collecting Call Control Problem on Weighted Lines and Rings ⋮ Submodular unsplittable flow on trees ⋮ Scheduling Resources for Throughput Maximization ⋮ Stochastic makespan minimization in structured set systems
This page was built for publication: Approximation algorithms for the unsplittable flow problem
