Author:
Kirousis Lefteris M.,Kranakis Evangelos,Krizanc Danny,Pelc Andrzej
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. E. Arikan, “Some Complexity Results about Packet Radio Networks,” IEEE Transactions on Information Theory, IT-30 (1984), pp. 681–685.
2. A. Ephremides and T. Truong, “Scheduling broadcasts in multihop radio networks,” IEEE Transactions on Communications, 30 (1990), pp. 456–461.
3. M.R. Garey and D.S. Johnson, “Computers and Intractability — A Guide to the Theory of NP-Completeness”, Freeman and Co., New York, 1979.
4. R. Kahn, S. Gronemeyer, J. Burchfiel and R. Kunzelman, “Advances in packet-radio technology,” Proceedings of the IEEE, 66 (1978), pp. 1468–1496.
5. K. Pahlavan and A. Levesque, “Wireless Information Networks,” Wiley-Interscience, New York, 1995.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献