A Mazing 2+ε Approximation for Unsplittable Flow on a Path
暂无分享,去创建一个
[1] Esther M. Arkin,et al. Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..
[2] Refael Hassin,et al. Allocation of bandwidth and storage , 2002 .
[3] Baruch Schieber,et al. A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.
[4] Dror Rawitz,et al. Resource Allocation in Bounded Degree Trees , 2007, Algorithmica.
[5] Fabrizio Grandoni,et al. Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path , 2013, IPCO.
[6] Fabrizio Grandoni,et al. A Mazing 2+∊ Approximation for Unsplittable Flow on a Path , 2014, SODA.
[7] Chandra Chekuri,et al. Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.
[8] Cynthia A. Phillips,et al. Off-line admission control for general scheduling problems , 2000, SODA '00.
[9] Andreas Wiese,et al. Submodular unsplittable flow on trees , 2016, IPCO.
[10] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[11] Yossi Azar,et al. Combinatorial Algorithms for the Unsplittable Flow Problem , 2005, Algorithmica.
[12] Nikhil Bansal,et al. A logarithmic approximation for unsplittable flow on line graphs , 2014, TALG.
[13] 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.
[14] Ulrich Pferschy,et al. Resource allocation with time intervals , 2010, Theor. Comput. Sci..
[15] Chandra Chekuri,et al. Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.
[16] Yuval Rabani,et al. Improved Approximation Algorithms for Resource Allocation , 2002, IPCO.
[17] Fabrizio Grandoni,et al. A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes , 2018, STOC.
[18] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[19] Amit Kumar,et al. Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.
[20] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.
[21] Amit Kumar,et al. New Approximation Schemes for Unsplittable Flow on a Path , 2015, SODA.
[22] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[23] Andrea Vitaletti,et al. Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints , 2000, FSTTCS.
[24] Marek Chrobak,et al. Caching Is Hard—Even in the Fault Model , 2012, Algorithmica.