Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth.
Hans L. BodlaenderMarek CyganStefan KratschJesper NederlofPublished in: ICALP (1) (2013)
Keyphrases
- randomized algorithms
- benchmark problems
- optimization problems
- combinatorial optimization
- approximate solutions
- learning algorithm
- computational problems
- difficult problems
- space complexity
- test problems
- orders of magnitude
- theoretical analysis
- worst case
- computationally efficient
- decision problems
- upper bound
- black box
- np hard problems
- computationally hard
- exact and approximate
- practical problems
- computational geometry
- exact algorithms
- run times
- genetic algorithm
- data structure
- computational complexity
- association rules
- heuristic methods
- search space
- evolutionary algorithm
- significant improvement
- machine learning algorithms