{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:45Z","timestamp":1725486705637},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730897"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73090-3_23","type":"book-chapter","created":{"date-parts":[[2007,6,30]],"date-time":"2007-06-30T04:29:02Z","timestamp":1183177742000},"page":"338-353","source":"Crossref","is-referenced-by-count":2,"title":["A Fully Polynomial Approximation Algorithm for Collaborative Relaying in Sensor Networks Under Finite Rate Constraints"],"prefix":"10.1007","author":[{"given":"Rajgopal","family":"Kannan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangqing","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasu","family":"Chakravarthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali","family":"Rangaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"issue":"54","key":"23_CR2","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TCOMM.2006.873058","volume":"4","author":"Z. Lin","year":"2006","unstructured":"Lin, Z., Erkip, E., Stefanov, A.: Cooperative regions and partner choice in coded cooperative systems. IEEE Transactions on Communications\u00a04(54), 760 (2006)","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/JSAC.2007.070212","volume":"25","author":"A. Nosratinia","year":"2007","unstructured":"Nosratinia, A., Hunter, T.E.: Grouping and partnership selection in cooperative wireless networks. IEEE J. Select. Areas Commun.\u00a025(2), 1\u201310 (2007)","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"10","key":"23_CR4","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1109\/TIT.2003.817466","volume":"49","author":"D.J.L. Love","year":"2003","unstructured":"Love, D.J.L., Heath Jr, R.W., Strohmer, T.: Grassmannian beamforming for multiple-input multiple-output wireless systems. IEEE Trans. Inform. Theory\u00a049(10), 2735\u20132747 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TCOMM.2006.873074","volume":"54","author":"N. Ahmed","year":"2006","unstructured":"Ahmed, N., Khojastepour, M.A., Sabharwal, A., Aazhang, B.: Outage minimization with limited feedback for the fading relay channel. IEEE Trans. Commun.\u00a054(4), 659\u2013669 (2006)","journal-title":"IEEE Trans. Commun."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Wei, S., Kannan, R.: Strategic versus collaborative power control in relay fading channels. In: IEEE International Symposium on Information Theory (ISIT), Seattle (July 2006)","DOI":"10.1109\/ISIT.2006.262052"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"3062","DOI":"10.1109\/TIT.2004.838089","volume":"50","author":"J. Laneman","year":"2004","unstructured":"Laneman, J., Tse, D., Wornel, G.: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inform. Theory\u00a050, 3062\u20133080 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. Part II: The p-medians. SIAM J. Appl. Math.\u00a037, 539\u2013560 (1979)","journal-title":"SIAM J . Appl. Math."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A.: An o(pn ) algorithm for p-median and related problems on tree graphsi. Operation Research Letters\u00a019, 59\u201364 (1996)","journal-title":"Operation Research Letters"},{"key":"23_CR10","unstructured":"Benkoczi, R., Bhattacharya, B., Chrobak, M.L.L.: Faster algorithms for k-medians in trees. Extended Abstract."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0167-6377(91)90041-M","volume":"10","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Tamir, A.: Improved complexity bounds for location problems on the real line. Operation Research Letters\u00a010, 395\u2013402 (1991)","journal-title":"Operation Research Letters"},{"issue":"1","key":"23_CR12","first-page":"87","volume":"26","author":"V. Auletta","year":"1998","unstructured":"Auletta, V., Parente, D., Persiano, G.: Placing resources on a growing line. J. Algorithms\u00a026(1), 87\u2013100 (1998)","journal-title":"J. Algorithms"},{"key":"23_CR13","volume-title":"Proc. of IEEE INFOCOM","author":"B. Li","year":"1999","unstructured":"Li, B., Golin, M.J., Italiano, G.F., Deng, X.: On the optimal placement of web proxies in the internet. In: Proc. of IEEE INFOCOM, IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0167-6377(00)00041-9","volume":"27","author":"G. Woeginger","year":"2000","unstructured":"Woeginger, G.: Monge strikes again: optimal placement of web proxies in the internet. Operation Research Letters\u00a027, 93\u201396 (2000)","journal-title":"Operation Research Letters"},{"key":"23_CR15","unstructured":"Kannan, R., Wei, S., Deng, G., Chakravarthy, V., Rangaswamy, M.: Energy efficient relaying via channel quantization in wireless networks. In: 41st Annual Conference on Information Sciences and Systems (CISS 07), JHU (March 2007)"},{"key":"23_CR16","first-page":"1","volume-title":"ACM Symposium on Theory of Computing","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k -median problem (extended abstract). In: ACM Symposium on Theory of Computing, pp. 1\u201310. ACM Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing in Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73090-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:40Z","timestamp":1605762700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73090-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730897"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73090-3_23","relation":{},"subject":[]}}