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).The main part of the article is framed by an introduction presenting an in-depth overview of the existing literature with several cross references to related results and by a brief conclusion summarizing the main contribution. The actual contribution is structured into three sections: static single covers, static plural covers, and dynamic single covers.After introducing the single cover problem in undirected static networks, both the concept and structural properties of (minimal) deficient sets are mentioned. A new proof of an exact greedy solution algorithm to the single cover problem is given, which relies on the matroidal structure of the problem. Finally, a polynomial time algorithm for computing the family of all deficient sets is presented, generalizing an algorithm tackling the case of uniform demands.This comment refers to the invited paper available at
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.