Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
暂无分享,去创建一个
[1] Debmalya Panigrahi,et al. Survivable network design problems in wireless networks , 2011, SODA '11.
[2] Vahab S. Mirrokni,et al. Power Optimization for Connectivity Problems , 2005, IPCO.
[3] Thomas Erlebach,et al. Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth , 2014, SOFSEM.
[4] Z.-Q. Ye,et al. Finding Paths with Minimum Shared Edges in Graphs with Bounded Treewidth , 2013 .
[5] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[6] Eytan Modiano,et al. Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks , 2005, Wirel. Networks.
[7] Zeev Nutov,et al. On minimum power connectivity problems , 2007, J. Discrete Algorithms.
[8] Zeev Nutov. Approximating Steiner Networks with Node-Weights , 2010, SIAM J. Comput..
[9] Zeev Nutov. Survivable Network Activation Problems , 2012, LATIN.
[10] B. Mohar,et al. Graph Minors , 2009 .
[11] Thomas Erlebach,et al. Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost , 2013, CIAC.
[12] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.