An O(c^k n) 5-Approximation Algorithm for Treewidth.
Hans L. BodlaenderPål Grønås DrangeMarkus S. DregiFedor V. FominDaniel LokshtanovMichal PilipczukPublished in: FOCS (2013)
Keyphrases
- detection algorithm
- search space
- dynamic programming
- learning algorithm
- experimental evaluation
- similarity measure
- matching algorithm
- optimization algorithm
- expectation maximization
- improved algorithm
- k means
- space complexity
- upper bound
- worst case
- high accuracy
- simulated annealing
- preprocessing
- convergence rate
- computational complexity
- optimal solution
- ant colony optimization
- polynomial time approximation
- boolean functions
- error bounds
- error tolerance
- times faster
- theoretical analysis
- computationally efficient
- particle swarm optimization
- linear programming
- computational cost
- np hard
- cost function