A PTAS for minimum d-hop connected dominating set in growth-bounded graphs
| Year of publication: |
2010
|
|---|---|
| Authors: | Gao, Xiaofeng ; Wang, Wei ; Zhang, Zhao ; Zhu, Shiwei ; Wu, Weili |
| Published in: |
Optimization letters. - Berlin : Springer, ISSN 1862-4472, ZDB-ID 2274663-8. - Vol. 4.2010, 3, p. 321-333
|
| Subject: | Graphentheorie | Graph theory | Handelspräferenzen | Trade preferences |
-
Forge, Fabien, (2021)
-
EU trade policy reform : towards reciprocal concessions with developing countries
Gnutzmann-Mkrtchyan, Arevik, (2022)
-
Instinctive commercial peace theorists? : interpreting American views of the US-China trade war
Bulman, David J., (2022)
- More ...
-
A better constant-factor approximation for weighted dominating set in unit disk graph
Huang, Yaochun, (2009)
-
Wireless networking, dominating and packing
Wu, Weili, (2010)
-
Efficient algorithms for supergraph query processing on graph databases
Zhang, Shuoxun, (2011)
- More ...