Stefan Ruzika, Carolin Torchian
The goal of the article at hand is twofold: First, it aims at reviewing several variants of source location problems in undirected networks and summarizes briefly the existing literature. Second, it extends the state of the art by presenting new theoretical findings (e.g. the matroidal structure of static single covers or new structural results for deficient sets), by proposing new algorithms with improved worst-case running time (e.g. a pseudo-polynomial time algorithm and a related fully polynomial time approximation scheme for static plural covers), and by introducing new model variants (e.g. cover problems in dynamic networks).
© 2008-2024 Fundación Dialnet · Todos los derechos reservados