English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching Few Receivers Quickly, and Energy-efficient Travelling Salesman Tours

MPS-Authors
/persons/resource/persons44464

Funke,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44893

Laue,  Soeren
Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Discrete Optimization, MPI for Informatics, Max Planck Society;

/persons/resource/persons44944

Lotker,  Zvi
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45109

Naujoks,  Rouven
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Funke, S., Laue, S., Lotker, Z., & Naujoks, R. (2011). Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching Few Receivers Quickly, and Energy-efficient Travelling Salesman Tours. Ad Hoc Networks, 9(6), 1028-1035. doi:10.1016/j.adhoc.2010.08.016.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-1288-8
Abstract
There is no abstract available