New Approximation Schemes for Unsplittable Flow on a Path
暂无分享,去创建一个
[1] Chandra Chekuri,et al. Multicommodity demand flow in a tree and packing integer programs , 2007, TALG.
[2] Baruch Schieber,et al. A quasi-PTAS for unsplittable flow on line graphs , 2006, STOC '06.
[3] Sanjeev Khanna,et al. An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow , 2006, Theory Comput..
[4] Paul S. Bonsma,et al. A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths , 2011, FOCS.
[5] Chandra Chekuri,et al. Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs , 2009, APPROX-RANDOM.
[6] A. Frieze,et al. Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .
[7] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..
[8] Nikhil Bansal,et al. A logarithmic approximation for unsplittable flow on line graphs , 2014, TALG.
[9] Sanjeev Khanna,et al. Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion , 2005, FOCS.
[10] Fabrizio Grandoni,et al. A Mazing 2+∊ Approximation for Unsplittable Flow on a Path , 2014, SODA.
[11] Amit Kumar,et al. Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.
[12] Chak-Kuen Wong,et al. Approximate Algorithms for Some Generalized Knapsack Problems , 1976, Theor. Comput. Sci..
[13] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[14] Fabrizio Grandoni,et al. Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path , 2013, IPCO.
[15] Lisa Zhang,et al. Hardness of the undirected edge-disjoint paths problem with congestion , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[16] Kirk Pruhs,et al. Weighted geometric set multi-cover via quasi-uniform sampling , 2012, J. Comput. Geom..
[17] Kirk Pruhs,et al. The Geometry of Scheduling , 2010, FOCS.
[18] Fabrizio Grandoni,et al. Pricing on paths: a PTAS for the highway problem , 2011, SODA '11.
[19] Andreas Wiese,et al. How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking , 2015, APPROX-RANDOM.