{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:16:58Z","timestamp":1725502618870},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778707"},{"type":"electronic","value":"9783540778714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77871-4_10","type":"book-chapter","created":{"date-parts":[[2008,2,7]],"date-time":"2008-02-07T05:31:05Z","timestamp":1202362265000},"page":"99-113","source":"Crossref","is-referenced-by-count":2,"title":["Local Approximation Algorithms for Scheduling Problems in Sensor Networks"],"prefix":"10.1007","author":[{"given":"Patrik","family":"Flor\u00e9en","sequence":"first","affiliation":[]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[]},{"given":"Topi","family":"Musto","sequence":"additional","affiliation":[]},{"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"3\u20134","key":"10_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1142\/S021926590200063X","volume":"3","author":"M. Cardei","year":"2002","unstructured":"Cardei, M., MacCallum, D., Cheng, M.X., Min, M., Jia, X., Li, D., Du, D.Z.: Wireless sensor networks with energy efficient organization. Journal of Interconnection Networks\u00a03(3\u20134), 213\u2013229 (2002)","journal-title":"Journal of Interconnection Networks"},{"key":"10_CR3","first-page":"152","volume-title":"SECON 2007","author":"P. Flor\u00e9en","year":"2007","unstructured":"Flor\u00e9en, P., Kaski, P., Suomela, J.: A distributed approximation scheme for sleep scheduling in sensor networks. In: SECON 2007. Proc. 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, San Diego, CA, June 2007, pp. 152\u2013161. IEEE, Piscataway (2007)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Koushanfar, F., Taft, N., Potkonjak, M.: Sleeping coordination for comprehensive sensing using isotonic regression and domatic partitions. In: Proc. 25th Conference on Computer Communications (INFOCOM, Barcelona, April 2006), IEEE, Piscataway, NJ (2006)","DOI":"10.1109\/INFOCOM.2006.276"},{"key":"10_CR5","volume-title":"IPDPS 2005","author":"T. Moscibroda","year":"2005","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximizing the lifetime of dominating sets. In: IPDPS 2005. Proc. 19th IEEE International Parallel and Distributed Processing Symposium, Denver, CO, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1132905.1132922","volume-title":"MobiHoc 2006","author":"S.V. Pemmaraju","year":"2006","unstructured":"Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via domatic partitions. In: MobiHoc 2006. Proc. 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Florence, pp. 143\u2013154. ACM Press, New York (2006)"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s11276-005-1769-9","volume":"11","author":"K. Jain","year":"2005","unstructured":"Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of interference on multi-hop wireless network performance. Wireless Networks\u00a011(4), 471\u2013487 (2005)","journal-title":"Wireless Networks"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2002","unstructured":"Feige, U., Halld\u00f3rsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM Journal on Computing\u00a032(1), 172\u2013195 (2002)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM\u00a041(5), 960\u2013981 (1994)","journal-title":"Journal of the ACM"},{"key":"10_CR10","unstructured":"Suomela, J.: Locality helps sleep scheduling. In: WSW 2006. Working Notes of the Workshop on World-Sensor-Web: Mobile Device-Centric Sensory Networks and Applications, Boulder, CO, October 2006, pp. 41\u201344 (2006), \n                  \n                    http:\/\/www.sensorplanet.org\/wsw2006\/"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1145\/1109557.1109666","volume-title":"SODA 2006","author":"F. Kuhn","year":"2006","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA 2006. Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithm, Miami, FL, January 2006, pp. 980\u2013989. ACM Press, New York (2006)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing\u00a034(6), 1302\u20131323 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt III","year":"1998","unstructured":"Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"Journal of Algorithms"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/3-540-58325-4_206","volume-title":"Algorithms and Computation","author":"T. Jiang","year":"1994","unstructured":"Jiang, T., Wang, L.: An approximation scheme for some Steiner tree problems in the plane. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 414\u2013422. Springer, Heidelberg (1994)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ipl.2007.02.001","volume":"103","author":"J. Suomela","year":"2007","unstructured":"Suomela, J.: Approximability of identifying codes and locating-dominating codes. Information Processing Letters\u00a0103(1), 28\u201333 (2007)","journal-title":"Information Processing Letters"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1080810.1080827","volume-title":"DIALM-POMC 2005","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Nieberg, T., Moscibroda, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: DIALM-POMC 2005. Proc. Joint Workshop on Foundations of Mobile Computing, Cologne, September 2005, pp. 97\u2013103. ACM Press, New York (2005)"},{"key":"10_CR19","unstructured":"Ghys, \u00c9.: Les groupes hyperboliques. Ast\u00e9risque 189\u2013190, 203\u2013238 (1990), [S\u00e9minaire Bourbaki, vol. 1989\/90, Exp. No. 722]"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77871-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:06Z","timestamp":1619506446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77871-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540778707","9783540778714"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77871-4_10","relation":{},"subject":[]}}