An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons.
Bern-Cherng LiawRichard C. T. LeePublished in: Inf. Process. Lett. (1994)
Keyphrases
- optimal solution
- worst case
- cooperative
- dynamic programming
- improved algorithm
- minimum length
- detection algorithm
- learning algorithm
- experimental evaluation
- computational cost
- optimization algorithm
- theoretical analysis
- objective function
- globally optimal
- convex hull
- times faster
- high accuracy
- np hard
- input data
- computational complexity
- clustering method
- locally optimal
- preprocessing
- search space
- cost function
- globally optimal solutions
- obtain the optimal solution
- operating point
- optimal parameters
- knapsack problem
- k means
- closed form
- tree structure
- ant colony optimization
- upper bound
- segmentation algorithm
- computationally efficient
- expectation maximization