@article{f0adcb806502467b8887e841250db7c4,
title = "Efficient algorithms for center problems in cactus networks",
abstract = "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 1-center problem, and an O (n log3 n) 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 problem in weighted cactus networks.",
keywords = "Cactus networks, Center problems, Facility location optimization",
author = "Boaz Ben-Moshe and Binay Bhattacharya and Qiaosheng Shi and Arie Tamir",
note = "Funding Information: Research of the second author was partially supported by MITACS and NSERC.",
year = "2007",
month = jun,
day = "9",
doi = "10.1016/j.tcs.2007.02.033",
language = "אנגלית",
volume = "378",
pages = "237--252",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier B.V.",
number = "3",
}