Abstract
We consider the problem of Simultaneous Source Location -selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an exact algorithm for trees and show how this can be combined with a result of Räcke to give a solution that exceeds edge capacities by at most O(log2 n log log n), where n is the number of nodes. On graphs of bounded treewidth, we show the problem is still NP-Hard, but we are able to give a PTAS with at most O(1+ε) violation of the capacities, or a (k+1)-approximation with exact capacities, where k is the treewidth and ε can be made arbitrarily small. © Springer-Verlag 2004.
Cite
CITATION STYLE
Andreev, K., Garrod, C., Maggs, B., & Meyerson, A. (2004). Simultaneous source location. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3122, 13–26. https://doi.org/10.1007/978-3-540-27821-4_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
