The obnoxious center problem on weighted cactus graphs.

DOI10.1016/S0166-218X(03)00452-9zbMath1046.90036MaRDI QIDQ1427192

Blaž Zmazek, Janez Žerovnik

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Linear-time algorithmLocation problemsCenter problemObnoxious facilities

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (17)

Efficient algorithms for center problems in cactus networks ⋮ Computing median and antimedian sets in median graphs ⋮ Review of obnoxious facilities location problems ⋮ Counting independent dominating sets in linear polymers ⋮ Obnoxious facility location in multiple dimensional space ⋮ On a conjecture for the signless Laplacian spectral radius of cacti with given matching number ⋮ Computing the center of uncertain points on cactus graphs ⋮ Backup 2-center on interval graphs ⋮ The Hosoya polynomial of double weighted graphs ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ Broadcasting on cactus graphs ⋮ Algorithm to find a maximum 2-packing set in a cactus ⋮ On the remoteness function in median graphs ⋮ Chain hexagonal cacti: matchings and independent sets ⋮ Zeroth-order general Randić index of cactus graphs ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs ⋮ Exploiting Structure: Location Problems on Trees and Treelike Graphs

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for finding a minimum dominating set in a cactus
• On some counting polynomials in chemistry
• Distance-related invariants on polygraphs
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A note on the location of an obnoxious facility on a network
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• Distance distributions for graphs modeling computer networks
• The Obnoxious Center Problem on a Tree
• Location of Multiple Obnoxious Facilities
• Diameters of weighted double loop networks
• Obnoxious Facility Location on Graphs
• Computing the Diameter in Multiple-Loop Networks

This page was built for publication: The obnoxious center problem on weighted cactus graphs.