A O(c^k n) 5-Approximation Algorithm for Treewidth
Hans L. BodlaenderPål Grønås DrangeMarkus S. DregiFedor V. FominDaniel LokshtanovMichal PilipczukPublished in: CoRR (2013)
Keyphrases
- cost function
- search space
- experimental evaluation
- learning algorithm
- computational complexity
- preprocessing
- worst case
- space complexity
- improved algorithm
- times faster
- optimization algorithm
- theoretical analysis
- upper bound
- objective function
- optimal solution
- closed form
- image segmentation
- dynamic programming
- detection algorithm
- segmentation algorithm
- search algorithm
- matching algorithm
- high accuracy
- multi objective
- error bounds
- convergence rate
- approximation algorithms
- recognition algorithm
- boolean functions
- similarity measure
- np hard