Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Optimality and complexity of pure Nash equilibria in the coverage game;Ai;IEEE J. Sel. Areas Commun.,2008
2. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks;Cheng;Networks,2003
3. Routing in ad-hoc networks using minimum connected dominating sets;Das,1997
4. Analytical approach to parallel repetition;Dinur,2014
5. Connected Dominating Set: Theory and Applications;Du,2013
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献