{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:29:33Z","timestamp":1740547773308,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_26","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"291-302","source":"Crossref","is-referenced-by-count":17,"title":["The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces"],"prefix":"10.1007","author":[{"given":"Deshi","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_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: Proceedings of 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN 2004 (2004)","DOI":"10.1109\/IPDPS.2004.1303265"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1996, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC 1998 (1998)","DOI":"10.1145\/276698.276725"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC 1998 (1998)","DOI":"10.1145\/276698.276719"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 379\u2013388 (1998)","DOI":"10.1109\/SFCS.1998.743488"},{"key":"26_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":"26_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":"26_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)"},{"key":"26_CR9","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks, Technical Report TR00-054, Electronic Colloquium on Computational Complexity(ECCC) (2000)"},{"issue":"299","key":"26_CR10","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":"26_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":"26_CR12","doi-asserted-by":"crossref","unstructured":"Garg, N., K\u00f6nemann, J.: Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, pp. 300\u2013309 (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"2","author":"M.D. Grigoriadis","year":"1996","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel pricedirective decomposition. Mathematics of Operations Research\u00a02, 321\u2013340 (1996)","journal-title":"Mathematics of Operations Research"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"Hu, T.C.: Optimum communication spanning trees. SIAM Journal on Computing\u00a03, 188\u2013195 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Proceedings of 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 (2002)","DOI":"10.1007\/978-0-387-35608-2_22"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science\u00a0(243), 289\u2013305 (2000)","DOI":"10.1016\/S0304-3975(98)00223-0"},{"key":"26_CR17","volume-title":"Packet Radio Routing","author":"G.S. Lauer","year":"1995","unstructured":"Lauer, G.S.: Packet Radio Routing, ch.11. Printice-Hall, Englewood Cliffs (1995)"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"2","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast Approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research\u00a02, 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"26_CR19","unstructured":"Rossi, G.: The Range Assignment Problem in Static Ad-Hoc Wireless Networks. Ph.D. Thesis (2003)"},{"key":"26_CR20","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/978-3-642-59179-2_23","volume-title":"Network Optimization","author":"J. Villavicencio","year":"1997","unstructured":"Villavicencio, J., Grigoriadis, M.D.: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W., Hager, W.W. (eds.) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0450, pp. 471\u2013485. Springer, Berlin (1997)"},{"key":"26_CR21","unstructured":"Wu, B.Y., Lancia, G., Bafna, V., Chao, K., Ravi, R., Tang, C.Y.: A polynomial time approximation scheme for minimum routine cost spanning trees. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998 (1998)"},{"key":"26_CR22","unstructured":"Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 170\u2013178 (1995)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-540-24767-8_81","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"H. Zhang","year":"2004","unstructured":"Zhang, H.: Packing: Scheduling, Embedding and Approximating Metrics. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 764\u2013775. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T15:48:25Z","timestamp":1740498505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}