Algorithmics in exponential time
From MaRDI portal
Recommendations
Cited in
(17)- Efficient approximation of Min Set Cover by moderately exponential algorithms
- On two techniques of combining branching and treewidth
- Exact algorithms for edge domination
- Treewidth computation and extremal combinatorics
- An exact algorithm for the minimum dominating clique problem
- Time-explicit Darwin PIC algorithm
- On the complexity of circuit satisfiability
- An Improved SAT Algorithm in Terms of Formula Length
- Computing in Finite Time
- Exact Algorithms for Edge Domination
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Exact algorithms for dominating set
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- New algorithmic paradigms in exponential time algorithms
- An exact algorithm for the Boolean connectivity problem for k-CNF
- An improved exact algorithm for the domatic number problem
- Solving connected dominating set faster than \(2^n\)
This page was built for publication: Algorithmics in exponential time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710689)