{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:01Z","timestamp":1725573301007},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_15","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"127-138","source":"Crossref","is-referenced-by-count":4,"title":["On the Hardness of Range Assignment Problems"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Fuchs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"Baker, B.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. Journal of the ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"Journal of the ACM"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. In: Proc. 26th ICALP, pp.\u00a0200\u2013209 (1999), Also available as ECCC Report TR98-065 at http:\/\/eccc.uni-trier.de\/eccc\/","DOI":"10.1007\/3-540-48523-6_17"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., M\u0103ndoiu, I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc.\u00a0IFIP TCS, vol.\u00a0223, pp. 119\u2013130 (2002)","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Inapproximability results for bounded variants of optimization problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 27\u201338. Springer, Heidelberg (2003), Also available as ECCC Report TR03-026","DOI":"10.1007\/978-3-540-45077-1_4"},{"key":"15_CR5","unstructured":"Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-Case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome \u201cTor Vergata\u201d, Math.\u00a0Department (2001)"},{"key":"15_CR6","unstructured":"Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23\u201338 (2002)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Clementi, A., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications\u00a09(2), 125\u2013140 (2004), Also available as ECCC Report TR00-054","DOI":"10.1023\/B:MONE.0000013624.32948.87"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","volume":"60","author":"P. Eades","year":"1996","unstructured":"Eades, P., Stirk, C., Whitesides, S.: The techniques of Kolmogorov and Bardzin for three-dimensional orthogonal graph drawings. Information Processing Letters\u00a060(2), 97\u2013103 (1996)","journal-title":"Information Processing Letters"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M. Garey","year":"1977","unstructured":"Garey, M., Johnson, D.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM Journal of Applied Mathematics\u00a032(4), 826\u2013834 (1977)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-Complete Problems. Theoretical Computer Science\u00a01, 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. Kirousis","year":"2000","unstructured":"Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"15_CR13","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscience, Hoboken (1995)"},{"key":"15_CR14","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 complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR15","unstructured":"Rossi, G.: The Range Assignment Problem in Static Ad-Hoc Wireless Networks (PhD-thesis), University of Siena (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:19Z","timestamp":1619507059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11758471_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}