The obnoxious center problem on weighted cactus graphs

Authors:
Blaz Zmazek;Janez Žerovnik
Affiliations:
University of Maribor, FS, Smetanova 17, Maribor 2000, Slovenia and Department of Theoretical Computer Science, Institute of Mathematics, Physics and Mechanics, Jadranska 19, Ljubljana 1111, Slove ...;University of Maribor, FS, Smetanova 17, Maribor 2000, Slovenia and Department of Theoretical Computer Science, Institute of Mathematics, Physics and Mechanics, Jadranska 19, Ljubljana 1111, Slove ...
Venue:
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Year:
2004

Citing 13
Cited 6

A linear algorithm for finding a minimum dominating set in a cactus algorithm for finding a minimum dominating set in a cactus

Discrete Applied Mathematics
On some counting polynomials in chemistry

Discrete Applied Mathematics - Applications of Graphs in Chemistry and Physics
Diameters of weighted double loop networks

Journal of Algorithms
Obnoxious facility location on graphs

SIAM Journal on Discrete Mathematics
Computing the diameter in multiple-loop networks

Journal of Algorithms
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
Distance-related invariants on polygraphs

Discrete Applied Mathematics - Special issue: 50th anniversary of the Wiener index
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
Graph classes: a survey

Graph classes: a survey
A linear-time algorithm for solving the center problem on weighted cactus graphs

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The Obnoxious Center Problem on a Tree

SIAM Journal on Discrete Mathematics
A Survey on Obnoxious Facility Location Problems

A Survey on Obnoxious Facility Location Problems

Efficient algorithms for center problems in cactus networks

Theoretical Computer Science
Obnoxious centers in graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the remoteness function in median graphs

Discrete Applied Mathematics
Obnoxious Centers in Graphs

SIAM Journal on Discrete Mathematics
Efficient algorithms for the weighted 2-center problem in a cactus graph

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Backup 2-center on interval graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. An algorithm is given which finds the obnoxious center on a weighted cactus graph in O(cn) time, where n is the number of vertices and c is the number of different vertex weights (called marks).