Efficient algorithms for center problems in cactus networks

@article{BenMoshe2007EfficientAF,
  title={Efficient algorithms for center problems in cactus networks},
  author={Boaz Ben-Moshe and Binay K. Bhattacharya and Qiaosheng Shi and Arie Tamir},
  journal={Theor. Comput. Sci.},
  year={2007},
  volume={378},
  pages={237-252}
}
Efficient algorithms for solving the center problems in weighted cactus networks are presented. In particular, we have proposed the following algorithms for the weighted cactus networks of size n: an O(n log n) time algorithm to solve the 1center problem, an O(n log 3n) time algorithm to solve the weighted continuous 2-center problem. We have also provided improved solutions to the general p-center problems in cactus networks. The developed ideas are then applied to solve the obnoxious 1-center… CONTINUE READING