Efficient algorithms for center problems in cactus networks

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

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)237-252
Number of pages16
JournalTheoretical Computer Science
Volume378
Issue number3
DOIs
StatePublished - 9 Jun 2007

Keywords

  • Cactus networks
  • Center problems
  • Facility location optimization

Fingerprint

Dive into the research topics of 'Efficient algorithms for center problems in cactus networks'. Together they form a unique fingerprint.

Cite this