Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Graphs and Digraphs, Fourth Edition
Graphs and Digraphs, Fourth Edition
Inclusion--Exclusion Algorithms for Counting Set Partitions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algorithmica - Parameterized and Exact Algorithms
The Travelling Salesman Problem in Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Graph-Theoretic Concepts in Computer Science
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hi-index | 0.00 |
In this paper we provide algorithms faster than O(2n) for two variants of the Irredundant Set problem. More precisely, we give: a branch-and-reduce algorithm solving Largest Irredundant Set in $\mathcal{O}(1.9657^{n})$ time and polynomial space; the time complexity can be reduced using memoization to $\mathcal{O}(1.8475^{n})$ at the cost of using exponential space, and a simple iterative-DFS algorithm for Smallest Inclusion-Maximal Irredundant Set that solves it in $\mathcal{O}(1.999956^{n})$ time and polynomial space. Inside the second algorithm time complexity analysis we use a structural approach which allows us to break the O(2n) barrier. We find this structural approach more interesting than the algorithm itself. Despite the fact that the discussed problems are quite similar to the Dominating Set problem solving them faster than the obvious O(2n) solution seemed harder; that is why they were posted as an open problems at the Dagstuhl seminar in 2008.