An approximation algorithm for the longest cycle problem in solid grid graphs.
Asghar Asgharian-SardroudAlireza BagheriPublished in: CoRR (2015)
Keyphrases
- experimental evaluation
- graph structure
- preprocessing
- k means
- optimization algorithm
- high accuracy
- cost function
- learning algorithm
- times faster
- tree structure
- detection algorithm
- expectation maximization
- computational complexity
- dynamic programming
- computational cost
- upper bound
- search space
- linear programming
- particle swarm optimization
- segmentation algorithm
- optimal solution
- graph partitioning
- undirected graph
- closed form
- polynomial time approximation
- graph construction
- neural network
- social networks
- similarity measure
- shortest path
- objective function
- theoretical analysis
- significant improvement