Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth.
Hans L. BodlaenderMarek CyganStefan KratschJesper NederlofPublished in: Inf. Comput. (2015)
Keyphrases
- optimization problems
- test problems
- randomized algorithms
- space complexity
- exact and approximate
- significant improvement
- run times
- benchmark problems
- decision trees
- difficult problems
- practical problems
- computationally efficient
- np hard problems
- exact algorithms
- problems in computer vision
- partial solutions
- computational geometry
- tree decompositions
- graph theory
- black box
- theoretical analysis
- computational cost
- approximate solutions
- search methods
- orders of magnitude
- computationally hard
- upper bound
- np hard
- computational complexity