An approximation algorithm for the longest path problem in solid grid graphs.
Asghar Asgharian-SardroudAlireza BagheriPublished in: Optim. Methods Softw. (2016)
Keyphrases
- times faster
- detection algorithm
- experimental evaluation
- learning algorithm
- dynamic programming
- expectation maximization
- graph structure
- computational complexity
- search space
- optimization algorithm
- np hard
- recognition algorithm
- theoretical analysis
- particle swarm optimization
- computational cost
- cost function
- k means
- preprocessing
- neural network
- similarity measure
- graph partitioning
- weighted graph
- minimum spanning tree
- randomized approximation
- error bounds
- clustering method
- high accuracy
- worst case
- knn
- data structure