2001年
Graph problems in multi-hop networks
ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
- ,
- ,
- ,
- ,
- 巻
- 4
- 号
- 開始ページ
- 894
- 終了ページ
- 897
- 記述言語
- 英語
- 掲載種別
- 研究論文（国際会議プロシーディングス）
- DOI
- 10.1109/ISCAS.2001.922382
In a multihop network, radio packets are often relayed through inter-mediate nodes (repeaters) in order to transfer a message. We consider a scheduling problem in a multihop network using two graph theoretical models. In this report, we prove that this problem is NP-hard, and we propose approximation algorithms for it. © 2001 IEEE.
- ID情報
-
- DOI : 10.1109/ISCAS.2001.922382
- SCOPUS ID : 84888018256