Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser, Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs, in: Proc. APPROX-RANDOM, 2006, pp. 3–14
2. A better constant-factor approximation for weighted dominating set in unit disk graph;Huang;J. Comb. Optim.,2008
3. Planar formulae and their uses;Lichtenstein;SIAM J. Comput.,1982
4. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks, 25, pp. 59–86
5. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs;Hunt;J. Algorithms,1998
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献