Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

AbstractWe give substantially improved exact exponential-time algorithms for a number of NP-hard problems. These algorithms are obtained using a variety of techniques. These techniques include: obtaining exact algorithms by enumerating maximal independent sets in a graph, obtaining exact algorithms from parameterized algorithms and a variant of the usual branch-and-bound technique which we call the "colored" branch-and-bound technique. These techniques are simple in that they avoid detailed case analyses and yield algorithms that can be easily implemented. We show the power of these techniques by applying them to several NP-hard problems and obtaining new improved upper bounds on the running time. The specific problems that we tackle are: (1) the Odd Cycle Transversal problem in general undirected graphs, (2) the Feedback Vertex Set problem in directed graphs of maximum degree 4, (3) Feedback Arc Set problem in tournaments, (4) the 4-Hitting Set problem and (5) the Minimum Maximal Matching and the Edge Dominating Set problems. The algorithms that we present for these problems are the best known and are a substantial improvement over previous best results. For example, for the Minimum Maximal Matching we give an O*(1.4425n) algorithm improving the previous best result of O*(1.4422m) [35]. For the Odd Cycle Transversal problem, we give an O*(1.62n) algorithm which improves the previous time bound of O*(1.7724n) [3].

[1]  Rolf Niedermeier,et al.  Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.

[2]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[3]  Zsolt Tuza,et al.  The Number of Maximal Independent Sets in Triangle-Free Graphs , 1993, SIAM J. Discret. Math..

[4]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[5]  Gerhard J. Woeginger,et al.  Space and Time Complexity of Exact Algorithms : Some Open Problems , 2004 .

[6]  J. Moon,et al.  On cliques in graphs , 1965 .

[7]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[8]  Daniel Lokshtanov,et al.  Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time , 2005, ACiD.

[9]  Rolf Niedermeier,et al.  Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT , 2003, Discret. Appl. Math..

[10]  Rolf Niedermeier,et al.  Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems , 2004, Algorithmica.

[12]  Rolf Niedermeier,et al.  An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.

[13]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[14]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[15]  Andreas Björklund,et al.  Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings , 2007, Algorithmica.

[16]  D. West.  Introduction to Graph Theory , 1995 .

[17]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[18]  Martin Fürer,et al.  Algorithms for Counting 2-SAT Solutions and Colorings with Applications , 2005, Electron. Colloquium Comput. Complex..

[19]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[20]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[21]  Jian-ErChen.  Parameterized Computation and Complexity： A New Approach Dealing with NP-Hardness , 2005 .

[22]  Jesper Makholm Byskov.  Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..

[23]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[24]  David Eppstein,et al.  3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.

[25]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[26]  Saket Saurabh,et al.  Triangles, 4-Cycles and Parameterized (In-)Tractability , 2006, SWAT.

[27]  Rodney G. Downey,et al.  Parameterized complexity for the skeptic , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[28]  Rolf Niedermeier,et al.  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover , 1999, J. Algorithms.

[29]  Fedor V. Fomin,et al.  Finding a Minimum Feedback Vertex Set in Time O (1.7548n) , 2006, IWPEC.

[30]  Ryan Williams.  A new algorithm for optimal constraint satisfaction and its implications , 2004, Electron. Colloquium Comput. Complex..

[31]  Rolf Niedermeier,et al.  A refined search tree technique for Dominating Set on planar graphs , 2005, J. Comput. Syst. Sci..

[32]  Jianer Chen,et al.  Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms , 2003, J. Comput. Syst. Sci..

[33]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[34]  Saket Saurabh,et al.  Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems , 2005, ICTCS.

[35]  Saket Saurabh,et al.  Parameterized algorithms for feedback set problems and their duals in tournaments , 2006, Theor. Comput. Sci..

[36]  Igor Razgon.  Exact Computation of Maximum Induced Forest , 2006, SWAT.

[37]  Kazuo Iwama,et al.  Improved upper bounds for 3-SAT , 2004, SODA '04.

[38]  Fedor V. Fomin,et al.  Finding minimum feedback vertex set in bipartite graph , 2005 .

[39]  Fabrizio Grandoni,et al.  Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms , 2005, Bull. EATCS.

[40]  Magnus Wahlström,et al.  Exact algorithms for finding minimum transversals in rank-3 hypergraphs , 2004, J. Algorithms.