A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.
Binay BhattacharyaSandip DasSubhadeep Ranjan DevPublished in: CoRR (2023)
Keyphrases
- detection algorithm
- computational complexity
- preprocessing
- significant improvement
- improved algorithm
- computational cost
- experimental evaluation
- weighted graph
- times faster
- learning algorithm
- minimum spanning tree
- k means
- cost function
- high accuracy
- graph structure
- particle swarm optimization
- input data
- worst case
- np hard
- evolutionary algorithm
- segmentation algorithm
- convergence rate
- simulated annealing
- random graphs
- graph construction
- adjacency graph
- graph isomorphism
- spectral graph