Designing FPT Algorithms for Cut Problems Using Randomized Contractions
暂无分享,去创建一个
Michal Pilipczuk | Mohammad Taghi Hajiaghayi | Marcin Pilipczuk | Rajesh Hemant Chitnis | Marek Cygan | M. Hajiaghayi | R. Chitnis | Marek Cygan | Marcin Pilipczuk | Michal Pilipczuk
[1] Joseph Naor,et al. Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs , 1995, IPCO.
[2] Dániel Marx,et al. Fixed-parameter tractability of multicut parameterized by the size of the cutset , 2010, STOC '11.
[3] Mikkel Thorup,et al. Rounding algorithms for a geometric embedding of minimum multiway cut , 1999, STOC '99.
[4] Barry O'Sullivan,et al. Finding small separators in linear time via treewidth reduction , 2011, TALG.
[5] Saket Saurabh,et al. LP can be a cure for Parameterized Problems , 2012, STACS.
[6] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[7] Dániel Marx,et al. Clustering with local restrictions , 2011, Inf. Comput..
[8] Jianer Chen,et al. An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem , 2007, Algorithmica.
[9] Ken-ichi Kawarabayashi,et al. The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[10] Moses Charikar,et al. Near-optimal algorithms for unique games , 2006, STOC '06.
[11] Polish Ministry. Subset feedback vertex set is fixed-parameter tractable , 2011 .
[12] Noga Alon,et al. Improved approximation for directed cut problems , 2007, STOC '07.
[13] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[14] Michal Pilipczuk,et al. On Group Feedback Vertex Set Parameterized by the Size of the Cutset , 2011, Algorithmica.
[15] David R. Karger,et al. Minimum cuts in near-linear time , 1998, JACM.
[16] Bruce A. Reed,et al. Packing directed circuits , 1996, Comb..
[17] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[18] Sudipto Guha,et al. The Steiner k-Cut Problem , 2006, SIAM J. Discret. Math..
[19] Igor Razgon. Large Isolating Cuts Shrink the Multiway Cut , 2011, ArXiv.
[20] Joseph Naor,et al. Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.
[21] Subhash Khot,et al. On the Unique Games Conjecture (Invited Survey) , 2005, 2010 IEEE 25th Annual Conference on Computational Complexity.
[22] Saket Saurabh,et al. Faster Parameterized Algorithms Using Linear Programming , 2012, ACM Trans. Algorithms.
[23] Barry O'Sullivan,et al. Almost 2-SAT is Fixed-Parameter Tractable , 2008, J. Comput. Syst. Sci..
[24] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[25] Dániel Marx,et al. Structure theorem and isomorphism test for graphs with excluded topological subgraphs , 2011, STOC '12.
[26] Paul D. Seymour,et al. Packing directed circuits fractionally , 1995, Comb..
[27] Joseph Naor,et al. An 8-approximation algorithm for the subset feedback vertex set problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[28] Sylvain Guillemot,et al. Parameterized complexity and approximability of the Longest Compatible Sequence problem , 2011, Discret. Optim..
[29] Dimitrios M. Thilikos,et al. Linear kernels for (connected) dominating set on H-minor-free graphs , 2012, SODA.
[30] Mihalis Yannakakis,et al. Multiway cuts in node weighted graphs , 2004, J. Algorithms.
[31] Mihalis Yannakakis,et al. Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.
[32] Mam Riess Jones. Color Coding , 1962, Human factors.
[33] Piotr Berman,et al. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..
[34] Mihalis Yannakakis,et al. Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.
[35] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[36] Dániel Marx,et al. Parameterized graph separation problems , 2004, Theor. Comput. Sci..
[37] Yuval Rabani,et al. Tree packing and approximating k-cuts , 2001, SODA '01.
[38] Mohammad Taghi Hajiaghayi,et al. Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset , 2011, SODA.
[39] Dimitrios M. Thilikos,et al. (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[40] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[41] Refael Hassin,et al. Multi-terminal maximum flows in node-capacitated networks , 1986, Discret. Appl. Math..
[42] R. Ravi,et al. Approximating k-cuts via network strength , 2002, SODA '02.
[43] Michal Pilipczuk,et al. On multiway cut parameterized above lower bounds , 2011, TOCT.
[44] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[45] Michal Pilipczuk,et al. Minimum bisection is fixed parameter tractable , 2013, STOC.
[46] Noga Alon,et al. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs , 1994, STOC '94.
[47] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[48] Barry O'Sullivan,et al. A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.
[49] Mihalis Yannakakis,et al. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..
[50] Moses Charikar,et al. Near-optimal algorithms for maximum constraint satisfaction problems , 2007, SODA '07.
[51] Sylvain Guillemot,et al. FPT algorithms for path-transversal and cycle-transversal problems , 2011, Discret. Optim..
[52] Nicolas Bousquet,et al. Multicut is FPT , 2010, STOC '11.
[53] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.