{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:15:52Z","timestamp":1740287752480,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_44","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"411-421","source":"Crossref","is-referenced-by-count":1,"title":["Assign Ranges in General Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Janka","family":"Chleb\u00edkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Ambuehl, C., Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., Silvestri, R.: The range assignment problem in non-homogeneous static ad-hoc networks. In: Proc. of 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN 2004 (2004)","DOI":"10.1109\/IPDPS.2004.1303265"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proc. of the 37th IEEE FOCS, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-39658-1_13","volume-title":"Algorithms - ESA 2003","author":"G. Calinescu","year":"2003","unstructured":"Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 114\u2013126. Springer, Heidelberg (2003)"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Kapoor, S., Sarwat, M.: Bounded hops power assignment in ad-hoc wireless networks. In: Proc. of the IEEE Wireless Communications and Networking Conference, WCNC 2004 (2004)","DOI":"10.1109\/WCNC.2004.1311664"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S1570-8705(03)00013-1","volume":"1","author":"I. Chlamtac","year":"2003","unstructured":"Chlamtac, I., Conti, M., Liu, J.J.-N.: Mobile ad hoc networking: imperactives and challenges. Ad Hoc Networks\u00a01, 13\u201364 (2003)","journal-title":"Ad Hoc Networks"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraph. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"issue":"2","key":"44_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-002-0985-2","volume":"35","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Ferreira, A., Penna, P., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica\u00a035(2), 95\u2013110 (2003)","journal-title":"Algorithmica"},{"key":"44_CR8","unstructured":"Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: ARACNE 2002, pp. 23\u201338 (2002)"},{"issue":"299","key":"44_CR9","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/S0304-3975(02)00538-8","volume":"1-3","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Ianni, M.D., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theoretical Computer Science\u00a01-3(299), 751\u2013761 (2003)","journal-title":"Theoretical Computer Science"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks, Technical Report ECCC TR00-054 (2000)","DOI":"10.1007\/3-540-46541-3_54"},{"key":"44_CR11","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, NY (1979)"},{"key":"44_CR12","unstructured":"Gupta, A.: Steiner points in tree metrics don\u2019t (really) help. In: Proc. of the 12th ACM\/SIAM SODA, pp. 220\u2013227 (2001)"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proc. of 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 (2002)","DOI":"10.1007\/978-0-387-35608-2_22"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science\u00a0(243), 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"44_CR15","volume-title":"Packet Radio Routing, (ch. 11)","author":"G.S. Lauer","year":"1995","unstructured":"Lauer, G.S.: Packet Radio Routing (ch. 11). Printice-Hall, Englewood Cliffs (1995)"},{"issue":"3","key":"44_CR16","first-page":"589","volume":"31","author":"J. Matou\u0161ek","year":"1990","unstructured":"Matou\u0161ek, J.: Bi-lipschitz embeddings into low dimensional Euclidean spaces. Comment. Math. Univ. Carolinae\u00a031(3), 589\u2013600 (1990)","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Perkins, C.E., Bhagwat, P.: Highly dynamic destination-sequence distence-vector routing (DSDV) for mobile computers. In: Computer Communications Review, pp. 234\u2013244 (October 1994)","DOI":"10.1145\/190809.190336"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Rabinovich, Y., Raz, R.: Lower bounds on the distortion of embedding finite metric spaces in graphs. In: GEOMETRY: Discrete and Computational Geometry, vol.\u00a019 (1998)","DOI":"10.1007\/PL00009336"},{"key":"44_CR19","unstructured":"Rao, S., Richa, A.W.: New approximation techniques for some ordering problems. In: Proc. of the 9th ACM-SIAM SODA, pp. 211\u2013218 (1998)"},{"key":"44_CR20","unstructured":"Rossi, G.: The range assignment problem in static ad-hoc wireless networks. Ph.D. Thesis (2003)"},{"key":"44_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-27796-5_26","volume-title":"Structural Information and Communication Complexity","author":"D. Ye","year":"2004","unstructured":"Ye, D., Zhang, H.: The range assignment problem in static ad-hoc networks on metric spaces. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 291\u2013302. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:17:02Z","timestamp":1740262622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11496199_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}