Hardness results for the power range assignment problem in packet radio networks: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1671, Issue , 1999, Pages 197-208

  Clementi, Andrea E F ^a   Penna, Paolo ^a   Silvestri, Riccardo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RADIO TRANSMISSION; RANDOM PROCESSES;

EXTENDED ABSTRACTS; MULTIHOP TRANSMISSION; OPTIMIZATION PROBLEMS; PACKET RADIO NETWORKS; POLYNOMIAL TIME APPROXIMATION SCHEMES; STRONG CONNECTIVITY; TOTAL POWER CONSUMPTION; TRANSMISSION RANGES;

PROBLEM SOLVING;

EID: 84958742210     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_21     Document Type: Conference Paper

References (15)

1. P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. Proc. 3rd Italian Conf. on Algorithms and Complexity, LNCS, Springer- Verlag(1203):288-298, 1997.
2. E. Arikan. Some complexity results about packet radio networks. IEEE Transactions on Information Theory, IT-30:456-461, 1984.
3. B.S. Baker. Approximation algorithms for np-complete problems on planar graphs. Journal of ACM, 41:153-180, 1994.
4. P. Berman and M. Karpinski. On some tighter inapproximability results. Electronic Colloquium on Computational Complexity, (29), 1998.
5. P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. Graph Drawing'96, LNCS, (1190):139-154, 1996.
6. A. Ephemides and T. Truong. Scheduling broadcast in multihop radio networks. IEEE Transactions on Communications, 30:456-461, 1990.
7. M.R. Garey and D.S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completness. Freeman and Co., New York, 1979.
8. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica-Special Issue on Graph Drawing, (16):4-32, 1996. (Extended Abstract in 33-th IEEE FOCS (1992)).
9. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS 97), LNCS.
10. K. Pahlavan and A. Levesque. Wireless Information Networks. Wiley-Interscince, New York, 1995.
11. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and com- plexity classes. J. Comput. System Science, 43:425-440, 1991.
12. C.H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, Inc., 1994.
13. S. Ramanathan and E. Lloyd. Scheduling boradcasts in multi-hop radio networks. IEEE/ACM Transactions on Networking, 1:166-172, 1993.
14. R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in radio network. INFOCOM, pages 497-504, 1989.
15. L. Valiant. Universality considerations in vlsi circuits. IEEE Transactions on Computers, C-30:135-140, 1981.