A better constant-factor approximation for weighted dominating set in unit disk graph
| Year of publication: |
2009
|
|---|---|
| Authors: | Huang, Yaochun ; Gao, Xiaofeng ; Zhang, Zhao ; Wu, Weili |
| Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 18.2009, 2, p. 179-194
|
| Subject: | Computernetz | Computer network | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Exact algorithms for the minimum load spanning tree problem
Zhu, Xiaojun, (2021)
-
Devi, E. Anna, (2020)
-
Optimization problems in self-organizing networks
Wolf, Steffen, (2010)
- More ...
-
A PTAS for minimum d-hop connected dominating set in growth-bounded graphs
Gao, Xiaofeng, (2010)
-
Wireless networking, dominating and packing
Wu, Weili, (2010)
-
Efficient algorithms for supergraph query processing on graph databases
Zhang, Shuoxun, (2011)
- More ...