On the approximability of the range assignment problem on radio networks in presence of selfish agents-Reference-Cited by-同舟云学术

On the approximability of the range assignment problem on radio networks in presence of selfish agents

Published:2005-10 Issue:1-2 Volume:343 Page:27-41
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Ambühl Christoph,Clementi Andrea E.F.,Penna Paolo,Rossi Gianluca,Silvestri Riccardo

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. G. Caˇlinescu, X.Y. Li, O. Frieder, P.J. Wan, Minimum-energy broadcast routing in static ad hoc wireless networks, in: Proc. of the 20th Annu. Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2001, pp. 1162–1171.

2. G. Calinescu, P.J. Wan, F. Zaragoza, Author communication, 2002.

3. E.H. Clarke, Multipart pricing of public goods, Public Choice, 1971, pp. 17–33.

4. A.E.F. Clementi, P. Crescenzi, P. Penna, G. Rossi, P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proc. of the 18th Annu. Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Vol. 2010, 2001, pp. 121–131.

5. The minimum range assignment problem on linear radio networks;Clementi;Algorithmica,2003

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounded-Hop Communication Networks;Algorithmica;2017-09-08

2. On the Minimum Cost Range Assignment Problem;Algorithms and Computation;2015

3. On the Bounded-Hop Range Assignment Problem;Lecture Notes in Computer Science;2015

4. Approximate Min-Power Strong Connectivity;SIAM Journal on Discrete Mathematics;2013-01

5. Energy Efficiency in Wireless Networks;Handbook of Combinatorial Optimization;2013