论文信息 - Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators - 字舞流文

Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators

F. B. Shepherd | Guyslain Naves | Henry Xia

[1] Julia Chuzhoy,et al. New hardness results for routing on disjoint paths , 2016, STOC.

[2] Sanjeev Khanna,et al. The all-or-nothing multicommodity flow problem , 2004, STOC '04.

[3] Chandra Chekuri,et al. Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion , 2013, SODA.

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

[5] Shang-Hua Teng,et al. Lower-Stretch Spanning Trees , 2008, SIAM J. Comput..

[6] Harald Räcke,et al. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.

[7] Éva Tardos,et al. Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks , 1998, J. Comput. Syst. Sci..

[8] Robert Krauthgamer,et al. Vertex Sparsifiers: New Results from Old Techniques , 2010, SIAM J. Comput..

[9] András Frank. Edge-disjoint paths in planar graphs , 1985, J. Comb. Theory, Ser. B.

[10] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.

[11] Anupam Gupta,et al. Cuts, Trees and ℓ1-Embeddings of Graphs* , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).