A better constant-factor approximation for weighted dominating set in unit disk graph
- 1 March 2008
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 18 (2) , 179-194
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Distributed low-cost backbone formation for wireless ad hoc networks2005
- On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networksJournal of Communications and Networks, 2002
- Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating SetsInformation and Computation, 1999
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998
- Simple heuristics for unit disk graphsNetworks, 1995
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Unit disk graphsDiscrete Mathematics, 1990
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- On approximation problems related to the independent set and vertex cover problemsDiscrete Applied Mathematics, 1984
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982