TY - JOUR
T1 - Efficient algorithms for center problems in cactus networks
AU - Ben-Moshe, Boaz
AU - Bhattacharya, Binay
AU - Shi, Qiaosheng
AU - Tamir, Arie
N1 - Funding Information:
Research of the second author was partially supported by MITACS and NSERC.
PY - 2007/6/9
Y1 - 2007/6/9
N2 - 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.
AB - 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.
KW - Cactus networks
KW - Center problems
KW - Facility location optimization
UR - http://www.scopus.com/inward/record.url?scp=34248230198&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2007.02.033
DO - 10.1016/j.tcs.2007.02.033
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:34248230198
VL - 378
SP - 237
EP - 252
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 3
ER -