CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

Polynomial time approximation schemes for base station coverage with minimum total radii

by: Nissan L. Tov, David Peleg
Comput. Netw., Vol. 47, No. 4. (March 2005), pp. 489-501, doi:10.1016/j.comnet.2004.08.012  Key: citeulike:12193237

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

This paper concerns a geometric disk problem motivated by base station placement issues arising in wireless network design. The problem requires covering a given set of clients by a collection of disks of variable radii around a given set of base station locations while minimizing the sum of radii. A polynomial time approximation scheme is presented for this problem.


santanubhowmick's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.