Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
暂无分享,去创建一个
[1] Thomas Rothvoß. Directed Steiner Tree and the Lasserre Hierarchy , 2011, ArXiv.
[2] Zeev Nutov. Degree Constrained Node-Connectivity Problems , 2013, Algorithmica.
[3] Erika Renáta Kovács. A Note On Strongly Edge-Disjoint Arborescences Kristóf Bérczi , 2012 .
[4] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Andreas Huck,et al. Disproof of a conjecture about independent branchings in k-connected directed graphs , 1995, J. Graph Theory.
[6] Bundit Laekhanukit. An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem , 2014, Algorithmica.
[7] R. Ravi,et al. A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.
[8] Adrian Vetta,et al. Approximating Rooted Steiner Networks , 2012, SODA.
[9] Éva Tardos,et al. Algorithms for a network design problem with crossing supermodular demands , 2004, Networks.
[10] Harald Räcke,et al. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.
[11] R. Ravi,et al. Tree embeddings for two-edge-connected network design , 2010, SODA '10.
[12] Samir Khuller,et al. On directed Steiner trees , 2002, SODA '02.
[13] Alex Zelikovsky,et al. A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.
[14] Guy Kortsarz,et al. Approximating fault-tolerant group-Steiner problems , 2012, Theor. Comput. Sci..
[15] Fabrizio Grandoni,et al. Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.
[16] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[17] Chandra Chekuri,et al. A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[18] Guy Kortsarz,et al. Approximating Minimum-Cost Connectivity Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.
[19] David P. Williamson,et al. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..
[20] Harold N. Gabow,et al. On the L∞-norm of extreme points for crossing supermodular directed network LPs , 2007, Math. Program..
[21] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[22] Guy Kortsarz,et al. Improved approximating algorithms for Directed Steiner Forest , 2009, SODA.
[23] Robert E. Tarjan,et al. Dominator Tree Certification and Divergent Spanning Trees , 2016, TALG.
[24] Geir Dahl,et al. Directed Steiner Problems with Connectivity Constraints , 1993, Discret. Appl. Math..
[25] Samir Khuller,et al. Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.
[26] K. Steiglitz,et al. The Design of Minimum-Cost Survivable Networks , 1969 .
[27] Robert E. Tarjan,et al. Addendum to “Dominator Tree Certification and Divergent Spanning Trees” , 2016, ACM Trans. Algorithms.
[28] Andrew V. Goldberg,et al. Improved approximation algorithms for network design problems , 1994, SODA '94.
[29] Zeev Nutov,et al. Approximating subset k-connectivity problems , 2011, J. Discrete Algorithms.
[30] Robert Krauthgamer,et al. Polylogarithmic inapproximability , 2003, STOC '03.
[31] Bundit Laekhanukit. Approximating Directed Steiner Problems via Tree Embedding , 2016, ICALP.
[32] Alex Zelikovsky,et al. An improved approximation scheme for the Group Steiner Problem , 2001, Networks.
[33] R. Ravi,et al. Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[34] Santosh S. Vempala,et al. An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph , 2003, SIAM J. Comput..
[35] Bundit Laekhanukit. Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems , 2014, SODA.
[36] László A. Végh,et al. Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs , 2014, SIAM J. Comput..
[37] Guy Kortsarz,et al. Approximating k-node Connected Subgraphs via Critical Graphs , 2005, SIAM J. Comput..
[38] Guy Kortsarz,et al. Approximating Fault-Tolerant Group-Steiner Problems , 2009, FSTTCS.
[39] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[40] Zeev Nutov. Node-Connectivity Survivable Network Problems , 2018, Handbook of Approximation Algorithms and Metaheuristics.
[41] Sudipto Guha,et al. Approximation algorithms for directed Steiner problems , 1999, SODA '98.
[42] László A. Végh,et al. Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[43] Bundit Laekhanukit,et al. An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem , 2012, SIAM J. Comput..
[44] Kamal Jain,et al. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[45] Adrian Vetta,et al. Approximation algorithms for network design with metric costs , 2005, STOC '05.
[46] Fabrizio Grandoni,et al. On Survivable Set Connectivity , 2015, SODA.
[47] Zeev Nutov. Approximating minimum-cost connectivity problems via uncrossable bifamilies , 2012, TALG.
[48] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..