Efficient algorithms for center problems in cactus networks

Authors:
Boaz Ben-Moshe;Binay Bhattacharya;Qiaosheng Shi;Arie Tamir
Affiliations:
School of Computer Science, College of Judea and Samaria, Ariel, 44837, Israel;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6;School of Mathematical Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel
Venue:
Theoretical Computer Science
Year:
2007

Citing 18
Cited 6

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Efficient algorithms for optimization and selection on series-parallel graphs

SIAM Journal on Algebraic and Discrete Methods
On the solution value of the continuous P-center location problem on a graph

Mathematics of Operations Research
Improved complexity bounds for center location problems on networks by using dynamic data structures

SIAM Journal on Discrete Mathematics
Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
On some optimization problems on k-trees and partial k-trees

Discrete Applied Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Off-line maintenance of planar configurations

Journal of Algorithms
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
A p-center grid-positioning aggregation procedure

Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Journal of the ACM (JACM)
A linear-time algorithm for solving the center problem on weighted cactus graphs

Information Processing Letters
The Obnoxious Center Problem on a Tree

SIAM Journal on Discrete Mathematics
The obnoxious center problem on weighted cactus graphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Finding r-Dominating Sets and p-Centers of Trees in Parallel

IEEE Transactions on Parallel and Distributed Systems
Cardinality constrained facility location problems in trees

Cardinality constrained facility location problems in trees
On search over rationals

Operations Research Letters

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

Proceedings of the twenty-fourth annual symposium on Computational geometry
Centdian computation for sensor networks

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The connected p-center problem on block graphs with forbidden vertices

Theoretical Computer Science
Spanning cactus of a graph: Existence, extension, optimization, and approximation

Discrete Applied Mathematics
Fast approximation algorithms for the diameter and radius of sparse graphs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved algorithms to network p-center location problems

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	5.23

Visualization

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(nlogn) time algorithm to solve the 1-center problem, and an O(nlog^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 problem in weighted cactus networks.