The Covert Set-Cover Problem with Application to Network Discovery
From MaRDI portal
Publication:3404448
DOI10.1007/978-3-642-11440-3_21zbMath1274.68688arXiv1202.1090OpenAlexW1880413285MaRDI QIDQ3404448
V. N. Muralidhara, Sandeep Sen
Publication date: 9 February 2010
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.1090
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Algorithms that access the input via queries, A story of diameter, radius, and (almost) Helly property, Unnamed Item, Network verification via routing table queries