Simultaneous Source Location Problem in Capacitated Networks

This research article explores the Simultaneous Source Location (SSL) problem in capacitated networks. It presents an exact algorithm for trees and a polynomial-time approximation scheme (PTAS) for graphs of bounded treewidth. The authors analyze the NP-hard nature of the problem and propose solutions that allow for controlled capacity violations. Applications include web caching and distribution network design, highlighting the importance of efficient source placement in various scenarios.