Untitled

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 simultaneously, with the goal of minimizing the number of locations chosen. For general directed and undirected graphs we give an O(log D) approximation algorithm, where D is the sum of demands, and prove matching Ω(log D) hardness results assuming P = NP. For undirected trees, we give an exact algorithm 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(log 2 n log log n), where n is the number of nodes. For undirected graphs of bounded treewidth we show that the problem is still NP-Hard, but we are able to give a PTAS with at most (1 + ) violation of the capacities for arbitrarily small , or a (k + 1)-approximation with exact capacities, where k is the treewidth.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Untitled

Cited by 3 publications

References 110 publications

Conditional matching preclusion sets

Conditional matching preclusion sets

Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults

Simultaneous source location

Contact Info

Product

Resources

About