Efficient algorithms for center problems in cactus networks

Boaz Ben-Moshe; Binay Bhattacharya; Qiaosheng Shi; Arie Tamir

doi:10.1016/j.tcs.2007.02.033

Efficient algorithms for center problems in cactus networks

Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi^*, Arie Tamir

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

46 Scopus citations

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 log³ 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.

Original language	English
Pages (from-to)	237-252
Number of pages	16
Journal	Theoretical Computer Science
Volume	378
Issue number	3
DOIs	https://doi.org/10.1016/j.tcs.2007.02.033
State	Published - 9 Jun 2007

Funding

Funders	Funder number
Natural Sciences and Engineering Research Council of Canada
Mitacs

Keywords

Cactus networks
Center problems
Facility location optimization

Access to Document

10.1016/j.tcs.2007.02.033

Cite this

@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",

}

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

SN - 0304-3975

VL - 378

SP - 237

EP - 252

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 3

ER -

Efficient algorithms for center problems in cactus networks

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this