A faster algorithm for Vertex Cover parameterized by solution size
暂无分享,去创建一个
[1] Leon Kellerhals,et al. Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees , 2022, IPEC.
[2] A. Kulik,et al. Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[3] Dekel Tsur,et al. Above guarantee parameterization for vertex cover on graphs with maximum degree 4 , 2018, Journal of Combinatorial Optimization.
[4] Mingyu Xiao,et al. A refined algorithm for maximum independent set in degree-4 graphs , 2017, J. Comb. Optim..
[5] Hiroshi Nagamochi,et al. An exact algorithm for maximum independent set in degree-5 graphs , 2016, Discret. Appl. Math..
[6] Geevarghese Philip,et al. Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee , 2015, SODA.
[7] Hiroshi Nagamochi,et al. Exact Algorithms for Maximum Independent Set , 2013, ISAAC.
[8] Henning Fernau,et al. A novel parameterised approximation algorithm for minimum vertex cover , 2013, Theor. Comput. Sci..
[9] Ragesh Jaiswal,et al. An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3 , 2013, ArXiv.
[10] Michael R. Fellows,et al. Parameterized approximation via fidelity preserving transformations , 2012, J. Comput. Syst. Sci..
[11] Saket Saurabh,et al. Faster Parameterized Algorithms Using Linear Programming , 2012, ACM Trans. Algorithms.
[12] Fedor V. Fomin,et al. Exact exponential algorithms , 2010, CACM.
[13] Ge Xia,et al. Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..
[14] Fabrizio Grandoni,et al. A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.
[15] Meena Mahajan,et al. Parameterizing above or below guaranteed values , 2009, J. Comput. Syst. Sci..
[16] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[17] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[18] Meena Mahajan,et al. Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..
[19] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[20] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[21] Hiroshi Nagamochi,et al. Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs , 2013, Theor. Comput. Sci..
[22] Jane Zundel. MATCHING THEORY , 2011 .
[23] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[24] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .