The Maximum Binary Tree Problem
暂无分享,去创建一个
Karthekeyan Chandrasekaran | Elena Grigorescu | Gabriel Istrate | Minshen Zhu | Shubhang Kulkarni | Young-San Lin
[1] Nikhil Bansal,et al. Additive Guarantees for Degree-Bounded Directed Network Design , 2009, SIAM J. Comput..
[2] Jacqueline Smith,et al. Minimum Degree Spanning Trees on Bipartite Permutation Graphs , 2011 .
[3] R. Ravi,et al. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees , 2000, STOC '00.
[4] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[5] Ryan Williams,et al. Limits and Applications of Group Algebras for Parameterized Problems , 2009, ICALP.
[6] Harold N. Gabow,et al. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.
[7] Dieter Kratsch,et al. Bandwidth of Chain Graphs , 1998, Inf. Process. Lett..
[8] Michal Pilipczuk,et al. Parameterized Algorithms , 2015, Springer International Publishing.
[9] Omid Amini,et al. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem , 2008, IWPEC.
[10] David R. Karger,et al. On approximating the longest path in a graph , 1997, Algorithmica.
[11] Noga Alon,et al. Color-coding , 1995, JACM.
[12] Sanjeev Khanna,et al. Approximating Longest Directed Paths and Cycles , 2004, ICALP.
[13] Richard H. Schelp,et al. Subgraphs of minimal degree k , 1990, Discret. Math..
[14] Ioannis Koutis,et al. Faster Algebraic Algorithms for Path and Packing Problems , 2008, ICALP.
[15] Ryan O'Donnell,et al. A New Point of NP-Hardness for 2-to-1 Label Cover , 2012, APPROX-RANDOM.
[16] Mohit Singh,et al. Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal , 2015, J. ACM.
[17] Venkatesan Guruswami,et al. Improved Inapproximability Results for Maximum k-Colorable Subgraph , 2013, Theory Comput..
[18] Satish Rao,et al. What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs , 2009, Algorithmica.
[19] Bruce A. Reed,et al. Degree constrained subgraphs , 2005, Electron. Notes Discret. Math..
[20] Andreas Björklund,et al. Narrow sieves for parameterized paths and packings , 2010, J. Comput. Syst. Sci..
[21] Ryan Williams,et al. Finding paths of length k in O*(2k) time , 2008, Inf. Process. Lett..
[22] Andreas Björklund,et al. Constrained Multilinear Detection and Generalized Graph Motifs , 2012, Algorithmica.
[23] Cosmin Bonchis,et al. On the heapability of finite partial orders , 2020, Discret. Math. Theor. Comput. Sci..
[24] Cosmin Bonchis,et al. Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems , 2016, DCFS.
[25] Sylvain Guillemot,et al. Finding and Counting Vertex-Colored Subtrees , 2010, Algorithmica.
[26] Satish Rao,et al. A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids , 2009, Theor. Comput. Sci..
[27] Mohit Singh,et al. Survivable Network Design with Degree or Order Constraints , 2009, SIAM J. Comput..
[28] Jesper Nederlof. Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems , 2009, ICALP.
[29] Georgios Zervas,et al. Heapable Sequences and Subsequences , 2011, ANALCO.
[30] R. Ravi,et al. Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds , 2005, SIAM J. Comput..
[31] Martin Fürer,et al. Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.
[32] Jeremy P. Spinrad,et al. Bipartite permutation graphs , 1987, Discret. Appl. Math..
[33] Stéphane Pérennes,et al. Degree-Constrained Subgraph Problems: Hardness and Approximation Results , 2008, WAOA.
[34] Guy Kortsarz,et al. On some network design problems with degree constraints , 2013, J. Comput. Syst. Sci..
[35] Ryuhei Uehara,et al. Efficient Algorithms for the Longest Path Problem , 2004, ISAAC.
[36] Michel X. Goemans,et al. Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).