A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic.
Binay BhattacharyaTsunehiko KamedaAmirhossein MozafariPublished in: CCCG (2022)
Keyphrases
- computational complexity
- objective function
- search space
- dynamic programming
- theoretical analysis
- learning algorithm
- improved algorithm
- times faster
- detection algorithm
- preprocessing
- ant colony optimization
- hardware implementation
- high accuracy
- experimental evaluation
- k means
- computationally efficient
- shortest path
- path planning
- search algorithm
- worst case
- linear programming
- optimization algorithm
- np hard
- significant improvement
- tree structure
- matching algorithm
- convex hull
- convergence rate
- data sets