default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFeng Zou
Publications
- 2011
[j13]Feng Zou, Yuexuan Wang, XiaoHua Xu, Xianyue Li, Hongwei Du, Peng-Jun Wan, Weili Wu:
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theor. Comput. Sci. 412(3): 198-208 (2011)- [c13]Feng Zou, Jiaofei Zhong, Weili Wu, Ding-Zhu Du, Junghoon Lee:
Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network. ICUIMC 2011: 64 - 2010
- [j12]Ning Zhang, Incheol Shin, Feng Zou, Weili Wu, My T. Thai:
Construction of Virtual Backbone with Multiple Factors Constraints in Wireless Ad-hoc Network. Ad Hoc Sens. Wirel. Networks 10(1): 27-59 (2010) - [j11]Xianyue Li, Feng Zou, Yaochun Huang, Donghyun Kim, Weili Wu:
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree. Algorithmica 56(3): 333-341 (2010) - [j10]Feng Zou, James Willson, Zhao Zhang, Weili Wu:
Fast Information Propagation in Social Networks. Discret. Math. Algorithms Appl. 2(1): 125-142 (2010) - [j9]Zengti Li, Suogang Gao, Hongjie Du, Feng Zou, Weili Wu:
Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field. J. Comput. Biol. 17(10): 1413-1423 (2010) - [j8]Zengti Li, Suogang Gao, Hongjie Du, Feng Zou, Weili Wu:
Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2. J. Comb. Optim. 20(4): 325-334 (2010) - [j7]XiaoHua Xu, Yuexuan Wang, Hongwei Du, Peng-Jun Wan, Feng Zou, Xianyue Li, Weili Wu:
Approximations for node-weighted Steiner tree in unit disk graphs. Optim. Lett. 4(3): 405-416 (2010) - 2009
- [j6]Feng Zou, Xianyue Li, Suogang Gao, Weili Wu:
Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18(4): 342-349 (2009) - [c11]Xianyue Li, XiaoHua Xu, Feng Zou, Hongwei Du, Peng-Jun Wan, Yuexuan Wang, Weili Wu:
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs. COCOA 2009: 36-48 - [c10]Feng Zou, Zhao Zhang, Weili Wu:
Latency-Bounded Minimum Influential Node Selection in Social Networks. WASA 2009: 519-526 - 2008
- [c9]Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu:
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs. COCOA 2008: 278-285 - [c8]Xianyue Li, Yaochun Huang, Feng Zou, Donghyun Kim, Weili Wu:
(1+rho)-Approximation for Selected-Internal Steiner Minimum Tree. COCOON 2008: 568-576 - [c6]Ning Zhang, Incheol Shin, Feng Zou, Weili Wu, My T. Thai:
Trade-off scheme for fault tolerant connected dominating sets on size and diameter. FOWANC 2008: 1-8 - [c5]Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu:
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network. WASA 2008: 134-140 - [c4]Donghyun Kim, Xianyue Li, Feng Zou, Zhao Zhang, Weili Wu:
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks. WASA 2008: 560-569
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
