An Approximation Algorithm for Covering Vertices by 4^+-Paths.
Mingyang GongZhi-Zhong ChenGuohui LinZhaohui ZhanPublished in: CoRR (2023)
Keyphrases
- optimal solution
- np hard
- closed form
- preprocessing
- k means
- significant improvement
- dynamic programming
- optimization algorithm
- similarity measure
- recognition algorithm
- particle swarm optimization
- high accuracy
- experimental evaluation
- computational complexity
- worst case
- computational cost
- computationally efficient
- theoretical analysis
- matching algorithm
- improved algorithm
- polynomial time approximation
- polygonal approximation
- random graphs
- undirected graph
- neural network
- convex hull
- clustering method
- detection algorithm
- linear programming
- simulated annealing