On the cover polynomial of a digraph
Journal of Combinatorial Theory Series B
A generating function approach to the Traveling Salesman Problem
ACM '77 Proceedings of the 1977 annual conference
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Dynamic Programming for Minimum Steiner Trees
Theory of Computing Systems
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Computing the Tutte Polynomial in Vertex-Exponential Time
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
A moderately exponential time algorithm for full degree spanning tree
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Exact algorithms for exact satisfiability and number of perfect matchings
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A Linear Vertex Kernel for Maximum Internal Spanning Tree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
An exact algorithm for connected red-blue dominating set
Journal of Discrete Algorithms
Invitation to algorithmic uses of inclusion-exclusion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Faster algorithm for optimum Steiner trees
Information Processing Letters
Capacitated domination faster than O(2n)
Information Processing Letters
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Capacitated domination faster than O(2n)
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
An exact algorithm for connected red-blue dominating set
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Irredundant set faster than O(2n)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Planar k-path in subexponential time and polynomial space
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Fast local search for the steiner problem in graphs
Journal of Experimental Algorithmics (JEA)
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Given a graph with n vertices, k terminals and bounded integer weights on the edges, we compute the minimum Steiner Tree in ${\mathcal{O}^*}(2^k)$ time and polynomial space, where the ${\mathcal{O}^*}$ notation omits poly (n ,k ) factors. Among our results are also polynomial-space $\mathcal{O}^*(2^n)$ algorithms for several ${\mathcal{NP}}$-complete spanning tree and partition problems. The previous fastest known algorithms for these problems use the technique of dynamic programming among subsets, and require exponential space. We introduce the concept of branching walks and extend the Inclusion-Exclusion algorithm of Karp for counting Hamiltonian paths. Moreover, we show that our algorithms can also be obtained by applying Möbius inversion on the recurrences used for the dynamic programming algorithms.