On the Power Assignment Problem in Radio Networks
暂无分享,去创建一个
[1] P. Berman,et al. On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..
[2] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[3] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.
[4] Imrich Chlamtac,et al. Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.
[5] Andrea E. F. Clementi,et al. The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.
[6] Viggo Kann,et al. Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.
[7] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[8] P. Tran-Gia,et al. Analysis of a Finite Storage System with Batch Input Arising out of Message Packetization , 1982, IEEE Trans. Commun..
[9] Philippe Piret. On the connectivity of radio networks , 1991, IEEE Trans. Inf. Theory.
[10] Rudolf Mathar,et al. Optimal transmission ranges for mobile communication in linear multihop packet radio networks , 1996, Wirel. Networks.
[11] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[12] Andrzej Pelc,et al. Power Consumption in Packet Radio Networks (Extended Abstract) , 1997, STACS.
[13] Wojciech Rytter,et al. Deterministic broadcasting in unknown radio networks , 2000, SODA '00.
[14] Subramanian Ramanathan,et al. Scheduling algorithms for multihop radio networks , 1993, TNET.
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Jerry D. Gibson,et al. Mobile Communications Handbook , 1999 .
[17] Erdal Arikan,et al. Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.
[18] Goos Kant,et al. Drawing planar graphs using the canonical ordering , 1996, Algorithmica.
[19] Roy D. Yates,et al. Stochastic power control for cellular radio systems , 1998, IEEE Trans. Commun..
[20] Andrzej Pelc,et al. Power consumption in packet radio networks , 2000, Theor. Comput. Sci..
[21] Keshab K. Parhi,et al. Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.
[22] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[23] Antonios Symvonis,et al. Two Algorithms for Three Dimensional Orthogonal Graph Drawing , 1996, GD.
[24] Anthony Ephremides,et al. Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..
[25] Jerry D. Gibson,et al. The Mobile Communications Handbook , 1995 .
[26] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[27] Andrea E. F. Clementi,et al. Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks , 1999, RANDOM-APPROX.