Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
Frederic DornFedor V. FominDimitrios M. ThilikosPublished in: SWAT (2006)
Keyphrases
- benchmark problems
- test problems
- detection algorithm
- computational complexity
- graph structure
- k means
- experimental evaluation
- worst case
- optimal solution
- search algorithm
- high accuracy
- tree structure
- combinatorial optimization
- expectation maximization
- clustering method
- graph isomorphism
- learning algorithm
- dynamic programming
- preprocessing
- objective function
- semi supervised
- simulated annealing
- computational cost
- optimization algorithm
- cost function
- significant improvement
- search space
- convergence rate
- lower bound
- minimum spanning tree
- iterative algorithms
- optimal or near optimal
- reinforcement learning