An approximation algorithm for the longest cycle problem in solid grid graphs.
Asghar Asgharian-SardroudAlireza BagheriPublished in: Discret. Appl. Math. (2016)
Keyphrases
- theoretical analysis
- optimization algorithm
- learning algorithm
- search space
- closed form
- error bounds
- cost function
- np hard
- dynamic programming
- experimental evaluation
- tree structure
- adjacency graph
- computational complexity
- detection algorithm
- segmentation algorithm
- search algorithm
- significant improvement
- polynomial time complexity
- random graphs
- preprocessing
- square grid
- distance transform
- approximation algorithms
- shortest path
- neural network
- particle swarm optimization
- worst case