PARAMETERIZING FROM THE EXTREMES: FEASIBLE PARAMETERIZATIONS OF SOME NP-OPTIMIZATION PROBLEMS
暂无分享,去创建一个
[1] Saket Saurabh,et al. Incompressibility through Colors and IDs , 2009, ICALP.
[2] Hannes Moser,et al. Parameterized complexity of finding regular induced subgraphs , 2009, J. Discrete Algorithms.
[3] Saket Saurabh,et al. A Moderately Exponential Time Algorithm for Full Degree Spanning Tree , 2008, TAMC.
[4] Michael R. Fellows,et al. On Problems without Polynomial Kernels (Extended Abstract) , 2008, ICALP.
[5] Stefan Szeider,et al. The Linear Arrangement Problem Parameterized Above Guaranteed Value , 2007, Theory of Computing Systems.
[6] Miroslav Chlebík,et al. Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover , 2007, Discret. Appl. Math..
[7] Arie M. C. A. Koster,et al. Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..
[8] László Lovász,et al. Ear-decompositions of matching-covered graphs , 1983, Comb..
[9] Noga Alon,et al. Color-coding , 1995, JACM.
[10] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[11] Henning Fernau,et al. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.
[12] Barry O'Sullivan,et al. Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) , 2008, ICALP.
[13] Saket Saurabh,et al. The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover , 2010, Algorithmica.
[14] Michel X. Goemans,et al. Minimum Bounded Degree Spanning Trees , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[15] Saket Saurabh. Exact Algorithms for Optimization and parameterized versions of some graph theoretic problems[HBNI Th 6] , 2008 .
[16] Rolf Niedermeier,et al. Invitation to data reduction and problem kernelization , 2007, SIGA.
[17] Rolf Niedermeier,et al. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..
[18] Bruno Courcelle,et al. The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.
[19] S. Poljak,et al. A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem , 1982, Canadian Journal of Mathematics.
[20] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[21] Jiong Guo,et al. Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual , 2006, IWPEC.
[22] U. Feige,et al. Combination can be hard: approximability of the unique coverage problem , 2006, SODA 2006.
[23] R. Sharan,et al. Complexity classication of some edge modication problems , 1999 .
[24] Jeanette P. Schmidt,et al. The Spatial Complexity of Oblivious k-Probe Hash Functions , 2018, SIAM J. Comput..
[25] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[26] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[27] Venkatesh Raman,et al. Parameterized complexity of finding subgraphs with hereditary properties , 2002, Theor. Comput. Sci..
[28] Yijia Chen,et al. On Parameterized Approximability , 2006, IWPEC.
[29] Philip N. Klein,et al. Approximation Algorithms for Steiner and Directed Multicuts , 1997, J. Algorithms.
[30] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[31] Michael R. Fellows,et al. Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy , 1994, STOC '94.
[32] D. West. Introduction to Graph Theory , 1995 .
[33] Robert W. Deming,et al. Independence numbers of graphs-an extension of the Koenig-Egervary theorem , 1979, Discret. Math..
[34] Fabrizio Grandoni,et al. Measure and conquer: a simple O(20.288n) independent set algorithm , 2006, SODA '06.
[35] Michael R. Fellows,et al. FPT is P-Time Extremal Structure I , 2005, ACiD.
[36] Srinivasan Venkatesh,et al. On the advantage over a random assignment , 2004, Random Struct. Algorithms.
[37] Saket Saurabh,et al. König Deletion Sets and Vertex Covers above the Matching Size , 2008, ISAAC.
[38] Gregory Gutin,et al. FPT algorithms and kernels for the Directed k-Leaf problem , 2008, J. Comput. Syst. Sci..
[39] Boris Konev,et al. MAX SAT approximation beyond the limits of polynomial-time approximation , 2001, Ann. Pure Appl. Log..
[40] J. Spencer. Ramsey Theory , 1990 .
[41] Paul D. Seymour,et al. Recognizing Berge Graphs , 2005, Comb..
[42] Noga Alon,et al. Spanning Directed Trees with Many Leaves , 2008, SIAM J. Discret. Math..
[43] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[44] Stefan Szeider,et al. A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound , 2009, ArXiv.
[45] Meena Mahajan,et al. Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..
[46] Erik Jan van Leeuwen,et al. Approximating geometric coverage problems , 2008, SODA '08.
[47] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[48] Barry O'Sullivan,et al. A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.
[49] Joseph Cheriyan,et al. Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching , 1998, Electron. Colloquium Comput. Complex..
[50] Rolf Niedermeier,et al. Fixed-Parameter Algorithms for Kemeny Scores , 2008, AAIM.
[51] Piotr Berman,et al. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..
[52] Lance Fortnow,et al. Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..
[53] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[54] Saket Saurabh,et al. Parameterized algorithms for feedback set problems and their duals in tournaments , 2006, Theor. Comput. Sci..
[55] Gérard D. Cohen,et al. Generalized hashing and parent-identifying codes , 2003, J. Comb. Theory, Ser. A.
[56] Noga Alon,et al. Solving MAX-r-SAT Above a Tight Lower Bound , 2010, SODA '10.
[57] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[58] Dieter Kratsch,et al. Degree-Preserving Forests , 1998, MFCS.
[59] William R. Pulleyblank,et al. König-Egerváry graphs, 2-bicritical graphs and fractional matchings , 1989, Discret. Appl. Math..
[60] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[61] Jianer Chen,et al. On approximating minimum vertex cover for graphs with perfect matching , 2005, Theor. Comput. Sci..
[62] Sundar Vishwanathan. On hard instances of approximate vertex cover , 2008, TALG.
[63] Alain Billionnet,et al. On interval graphs and matrice profiles , 1986 .
[64] Kurt Mehlhorn,et al. On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[65] Joseph Naor,et al. Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.
[66] Daniel Lokshtanov,et al. Wheel-Free Deletion Is W[2]-Hard , 2008, IWPEC.
[67] Gregory Gutin,et al. Minimum leaf out-branching and related problems , 2008, Theor. Comput. Sci..
[68] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[69] F Stersoul,et al. A characterization of the graphs in which the transversal number equals the matching number , 1979, J. Comb. Theory, Ser. B.
[70] Saket Saurabh,et al. On the Directed Degree-Preserving Spanning Tree Problem , 2009, IWPEC.
[71] Liming Cai,et al. Fixed-Parameter Approximation: Conceptual Framework and Approximability Results , 2006, IWPEC.
[72] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..
[73] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[74] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[75] Moni Naor,et al. Rank aggregation methods for the Web , 2001, WWW '01.
[76] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[77] Leizhen Cai,et al. Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..
[78] Gérard D. Cohen,et al. A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents , 2001, SIAM J. Discret. Math..
[79] Rolf Niedermeier,et al. New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.
[80] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[81] Saket Saurabh,et al. The Budgeted Unique Coverage Problem and Color-Coding , 2009, CSR.
[82] Krzysztof Pietrzak,et al. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems , 2003, J. Comput. Syst. Sci..
[83] Fedor V. Fomin,et al. Finding a Minimum Feedback Vertex Set in Time O (1.7548n) , 2006, IWPEC.
[84] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[85] Venkatesh Raman,et al. Parameterized complexity of the induced subgraph problem in directed graphs , 2007, Inf. Process. Lett..
[86] Liming Cai,et al. On Fixed-Parameter Tractability and Approximability of NP Optimization Problems , 1997, J. Comput. Syst. Sci..
[87] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[88] Vijay V. Vazirani,et al. A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..
[89] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[90] S. Janson,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[91] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[92] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[93] Alexander S. Kulikov,et al. A 2|E|/4-time algorithm for MAX-CUT , 2005 .
[94] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[95] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[96] David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..
[97] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[98] 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..
[99] Fedor V. Fomin,et al. A Linear Vertex Kernel for Maximum Internal Spanning Tree , 2009, ISAAC.
[100] Marcin Pilipczuk,et al. Exponential-Time Approximation of Hard Problems , 2008, ArXiv.
[101] Heiko Schröder,et al. Approximation Algorithms for the Vertex Bipartization Problem , 1997, SOFSEM.
[102] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[103] Pinar Heggernes,et al. Interval completion with few edges , 2007, STOC '07.
[104] Reuven Bar-Yehuda,et al. On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..
[105] Marco Cesati. Perfect Code is W[1]-complete , 2000, Inf. Process. Lett..
[106] Dániel Marx,et al. Obtaining a Planar Graph by Vertex Deletion , 2007, WG.
[107] Christian Sloper,et al. Reducing to Independent Set Structure -- the Case of k-Internal Spanning Tree , 2005, Nord. J. Comput..
[108] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..
[109] Gregory Gutin,et al. Some Parameterized Problems On Digraphs , 2008, Comput. J..
[110] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[111] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[112] Samir Khuller,et al. On local search and placement of meters in networks , 2000, SODA '00.
[113] Saket Saurabh,et al. Faster fixed parameter tractable algorithms for finding feedback vertex sets , 2006, TALG.
[114] Ryan Williams,et al. Confronting hardness using a hybrid approach , 2006, SODA '06.
[115] Jianer Chen,et al. Improved algorithms for path, matching, and packing problems , 2007, SODA '07.