scientific article; zbMATH DE number 7051239

MaRDI QIDQ4633882zbMATH OpenFDO

Authors N. Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad Salavatipour

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496847

Mathematics Subject Classification ID

Flows in graphs (05C21) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• A logarithmic approximation for unsplittable flow on line graphs
• A quasi-PTAS for unsplittable flow on line graphs
• Approximation algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• Approximation algorithms for the unsplittable flow problem on paths and trees
• New approximation schemes for unsplittable flow on a path
• A constant-factor approximation algorithm for unsplittable flow on paths
• A constant factor approximation algorithm for unsplittable flow on paths
• A (1+)-approximation for unsplittable flow on a path in fixed-parameter running time
• A mazing \(2+\epsilon\) approximation for unsplittable flow on a path

Cited in

(11)

• Scheduling split intervals with non-uniform demands
• Approximation algorithms for the ring loading problem with penalty cost
• Improved algorithms for scheduling unsplittable flows on paths
• A quasi-PTAS for unsplittable flow on line graphs
• A (2+)-approximation algorithm for the storage allocation problem
• Packing cars into narrow roads: PTASs for limited supply highway
• A logarithmic approximation for unsplittable flow on line graphs
• Resource allocation with time intervals
• Breaking the barrier of 2 for the storage allocation problem
• On the approximability of unsplittable flow on a path with time windows
• Unsplittable flow on a short path

This page was built for publication:

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