A Subquadratic Time Algorithm for the Weighted $k$-Center Problem on Cactus Graphs
Data Structures and Algorithms
2023-03-31 v1 Computational Geometry
Abstract
The weighted -center problem in graphs is a classical facility location problem where we place centers on the graph, which minimize the maximum weighted distance of a vertex to its nearest center. We study this problem when the underlying graph is a cactus with vertices and present an time algorithm for the same. This time complexity improves upon the time algorithm by Ben-Moshe et al. [TCS 2007], which is the current state-of-the-art.
Cite
@article{arxiv.2303.17204,
title = {A Subquadratic Time Algorithm for the Weighted $k$-Center Problem on Cactus Graphs},
author = {Binay Bhattacharya and Sandip Das and Subhadeep Ranjan Dev},
journal= {arXiv preprint arXiv:2303.17204},
year = {2023}
}
Comments
Submitted to Theoretical Computer Science