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

Funke, Stefan; Laue, Soeren; Lotker, Zvi; Naujoks, Rouven

doi:10.1016/j.adhoc.2010.08.016

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0010-1288-8

要旨

要旨はありません