On generating all maximal independent sets
Information Processing Letters
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Constrained weighted matchings and edge coverings in graphs
Discrete Applied Mathematics
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
Theory of Computing Systems
Exact computation of maximum induced forest
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
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
Exact algorithms for dominating set
Discrete Applied Mathematics
New parameterized algorithms for the edge dominating set problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
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
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
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we present a faster exact exponential timealgorithm for the edge dominating set problem. Our algorithm usesO(1.3226n) time and polynomial space. The algorithm combines an enumerationapproach based on enumerating minimal vertex covers withthe branch and reduce paradigm. Its time bound is obtained using themeasure and conquer technique. The algorithm is obtained by startingwith a slower algorithm which is refined stepwise. In this way a series ofalgorithms appears, each one slightly faster than the previous, resultingin the O(1.3226n) time algorithm. The techniques also gives faster exact algorithms for: minimum weightedge dominating set, minimum (weight) maximal matching, matrix dominationand the parametrised version of minimum weight maximal matching.