Abstract
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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.