A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints

DOI10.4230/LIPIcs.FSTTCS.2010.181zbMath1245.68032OpenAlexW1571851418MaRDI QIDQ2908848

Yogish Sabharwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury

Publication date: 29 August 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a05b.html

zbMATH Keywords

schedulingresource allocationapproximation algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Improved algorithms for resource allocation under varying capacity ⋮ Scheduling Resources for Throughput Maximization

This page was built for publication: A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints