On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
From MaRDI portal
Publication:2456357
DOI10.1016/j.tcs.2007.05.025zbMath1124.68082MaRDI QIDQ2456357
Ning Zhang, My T. Thai, Ravi Tiwari, Xiaochun Xu
Publication date: 18 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.025
68R10: Graph theory (including graph drawing) in computer science
68W25: Approximation algorithms
68M15: Reliability, testing and fault tolerance of networks and computer systems