Median problems on wheels and cactus graphs

Authors:
J. Hatzl
Affiliations:
University of Waterloo, Department of Management Sciences, 200 University Avenue West, Waterloo, ON, Canada
Venue:
Computing
Year:
2007

Citing 2
Cited 1

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

Computing
An O(pn2) algorithm for the p -median and related problems on tree graphs

Operations Research Letters

Centdian computation for sensor networks

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is dedicated to location problems on graphs. Wepropose a linear time algorithm for the 1-median problem on wheelgraphs. Moreover, some general results for the 1-median problem aresummarized and parametric median problems are investigated. Theseresults lead to a solution method for the 2-median problem oncactus graphs, i.e., on graphs where no two cycles have more thanone vertex in common. The time complexity of this algorithm isO(n2), where n is the number ofvertices of the graph.