Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows

In the well-studied Unsplittable Flow on a Path problem (UFP), we are given a path graph with edge capacities. Furthermore, we are given a collection of n tasks, each one characterized by a subpath, a weight, and a demand. Our goal is to select a maximum weight subset of tasks so that the total demand of selected tasks using each edge is upper bounded by the corresponding capacity. Chakaravarthy et al. [ESA’14] studied a generalization of UFP, bagUFP, where tasks are partitioned into bags, and we can select at most one task per bag. Intuitively, bags model jobs that can be executed at different times (with different duration, weight, and demand). They gave a \(O(\log n)\) approximation for bagUFP. This is also the best known ratio in the case of uniform weights. In this paper we achieve the following main results:

[1]  Chandra Chekuri,et al.  Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.

[2]  Branko Grünbaum,et al.  On a Coloring Problem. , 1960 .

[3]  Sudipto Guha,et al.  Approximating the Throughput of Multiple Machines in Real-Time Scheduling , 2002, SIAM J. Comput..

[4]  Fabrizio Grandoni,et al.  A Mazing 2+∊ Approximation for Unsplittable Flow on a Path , 2014, SODA.

[5]  Nikhil Bansal,et al.  A logarithmic approximation for unsplittable flow on line graphs , 2014, TALG.

[6]  Timothy M. Chan,et al.  Approximation Algorithms for Maximum Independent Set of Pseudo-Disks , 2009, Discrete & Computational Geometry.

[7]  Fabrizio Grandoni,et al.  Pricing on paths: a PTAS for the highway problem , 2011, SODA '11.

[8]  Paul S. Bonsma,et al.  A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[9]  Ulrich Pferschy,et al.  Resource allocation with time intervals , 2010, Theor. Comput. Sci..

[10]  Chandra Chekuri,et al.  Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.

[11]  Anamitra R. Choudhury,et al.  Improved Algorithms for Resource Allocation under Varying Capacity , 2014, ESA.

[12]  F. Spieksma.  On the approximability of an interval scheduling problem , 1999 .

[13]  Baruch Schieber,et al.  A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.

[14]  Fabrizio Grandoni,et al.  Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path , 2013, IPCO.

[15]  Yuval Rabani,et al.  Improved Approximation Algorithms for Resource Allocation , 2002, IPCO.

[16]  Amit Kumar,et al.  New Approximation Schemes for Unsplittable Flow on a Path , 2015, SODA.