A single-exponential FPT algorithm for the $K_4$-minor cover problem
Eun Jung KimChristophe PaulGeevarghese PhilipPublished in: CoRR (2012)
Keyphrases
- learning algorithm
- worst case
- high accuracy
- matching algorithm
- cost function
- objective function
- preprocessing
- improved algorithm
- k means
- linear complexity
- optimization algorithm
- probabilistic model
- experimental evaluation
- dynamic programming
- np hard
- optimal solution
- computational cost
- computational complexity
- search space
- selection algorithm
- times faster
- similarity measure
- linear programming
- theoretical analysis
- constraint satisfaction problems
- significant improvement
- detection algorithm
- np complete
- path planning
- expectation maximization
- recognition algorithm
- simulated annealing
- estimation algorithm
- data sets