Static and dynamic source locations in undirected networks
- Autores: Lara Turner, Dwi Poetranto Groß, Horst W. Hamacher, Sven O. Krumke
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 23, Nº. 3, 2015, págs. 619-646
- Idioma: inglés
- DOI: 10.1007/s11750-015-0395-7
- Enlaces
-
Resumen
Results from source location in the form of single cover problems in static networks are reviewed and extended by new results for the most general problem with arbitrary demands and costs. The matroidal structure of the single covers is established and used in a new and simple validity proof of the dual greedy algorithm for static single cover problems. Moreover, a primal greedy algorithm is derived which uses a new procedure to find the collection of all minimal deficient sets. For static plural cover problems on trees two linear-time algorithms to solve simultaneous and non-simultaneous problems with uniform costs are presented; for the simultaneous scenario with non-uniform costs, a pseudo-polynomial algorithm is proposed which can be turned into a fully polynomial-time approximation scheme. In contrast to its static counterpart, the single cover problem in dynamic, i.e., time-varying networks is shown to be strongly NP-hard. For special cases of the network topology polynomial algorithms are presented.
