Hardness Results for the Power Range Assignment Problem in Packet Radio Networks
- 1 January 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Some Tighter Inapproximability Results (Extended Abstract)Published by Springer Nature ,1999
- Hardness of approximating problems on cubic graphsPublished by Springer Nature ,1997
- Two algorithms for three dimensional orthogonal graph drawingPublished by Springer Nature ,1997
- Power consumption in packet radio networksPublished by Springer Nature ,1997
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Scheduling algorithms for multihop radio networksIEEE/ACM Transactions on Networking, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications, 1990
- Distributed scheduling of broadcasts in a radio networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981