Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
Iterative compression and exact algorithms
Theoretical Computer Science
Exact algorithms for edge domination
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Feedback vertex sets in tournaments
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Exact and parameterized algorithms for edge dominating set in 3-degree graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Parameterized edge dominating set in cubic graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
New parameterized algorithms for the edge dominating set problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Fast exponential algorithms for maximum γ-regular induced subgraph problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Note: A note on the parameterized complexity of unordered maximum tree orientation
Discrete Applied Mathematics
A refined exact algorithm for edge dominating set
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Algorithms for dominating clique problems
Theoretical Computer Science
Feedback Vertex Sets in Tournaments
Journal of Graph Theory
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Parameterized edge dominating set in graphs with degree bounded by 3
Theoretical Computer Science
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science
Hi-index | 0.00 |
We 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 anda 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].