{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:06Z","timestamp":1759638846749},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540663294"},{"type":"electronic","value":"9783540484134"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48413-4_21","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T12:52:41Z","timestamp":1295009561000},"page":"197-208","source":"Crossref","is-referenced-by-count":73,"title":["Hardness Results for the Power Range Assignment Problem in Packet Radio Networks"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P. Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 288\u2013298. Springer, Heidelberg (1997)"},{"key":"21_CR2","first-page":"456","volume":"IT-30","author":"E. Arikan","year":"1984","unstructured":"Arikan, E.: Some complexity results about packet radio networks. IEEE Transactions on Information Theory\u00a0IT-30, 456\u2013461 (1984)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Journal of ACM\u00a041, 153\u2013180 (1994)","journal-title":"Journal of ACM"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results. Electronic Colloquium on Computational Complexity\u00a029 (1998)","DOI":"10.1007\/3-540-48523-6_17"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Two algorithms for three dimensional orthogonal graph drawing. In: Graph Drawing 1996. LNCS, vol.\u00a01190, pp. 139\u2013154 (1996)","DOI":"10.1007\/3-540-62495-3_44"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/26.52656","volume":"30","author":"A. Ephemides","year":"1990","unstructured":"Ephemides, A., Truong, T.: Scheduling broadcast in multihop radio networks. IEEE Transactions on Communications\u00a030, 456\u2013461 (1990)","journal-title":"IEEE Transactions on Communications"},{"key":"21_CR7","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completness. Freeman and Co., New York (1979)"},{"key":"21_CR8","first-page":"4","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica. Special Issue on Graph Drawing\u00a016, 4\u201332 (1996) (Extended Abstract in 33-th IEEE FOCS (1992))","journal-title":"Special Issue on Graph Drawing"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023473","volume-title":"STACS 97","author":"L.M. Kirousis","year":"1997","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200. Springer, Heidelberg (1997)"},{"key":"21_CR10","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscince, New York (1995)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and com- plexity classes. J. Comput. System Science\u00a043, 425\u2013440 (1991)","journal-title":"J. Comput. System Science"},{"key":"21_CR12","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, Inc., Reading (1994)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"Ramanathan, S., Lloyd, E.: Scheduling boradcasts in multi-hop radio networks. IEEE\/ACM Transactions on Networking\u00a01, 166\u2013172 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Ramaswami, R., Parhi, K.: Distributed scheduling of broadcasts in radio network. in: INFOCOM, pp. 497\u2013504 (1989)","DOI":"10.1109\/INFCOM.1989.101493"},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"Valiant, L.: Universality considerations in vlsi circuits. IEEE Transactions on Computers\u00a0C-30, 135\u2013140 (1981)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48413-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:19:14Z","timestamp":1559942354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48413-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663294","9783540484134"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48413-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}