A Constant Time Algorithm for Domination Problems on Polygraphs.
Polona PavlicJanez ZerovnikPublished in: CTW (2012)
Keyphrases
- experimental evaluation
- np hard
- learning algorithm
- benchmark problems
- dynamic programming
- k means
- test problems
- recognition algorithm
- detection algorithm
- high accuracy
- probabilistic model
- search space
- similarity measure
- computational cost
- preprocessing
- computational complexity
- simulated annealing
- convergence rate
- path planning
- segmentation algorithm
- cost function
- optimal solution
- iterative algorithms
- objective function
- matching algorithm
- clustering method
- computationally efficient
- lower bound
- approximate solutions
- heuristic methods
- greedy algorithms
- data sets
- larger problems
- improved algorithm
- convex hull
- times faster
- optimization algorithm
- linear programming
- optimization problems