{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:16:59Z","timestamp":1725502619221},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778707"},{"type":"electronic","value":"9783540778714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77871-4_11","type":"book-chapter","created":{"date-parts":[[2008,2,7]],"date-time":"2008-02-07T05:31:05Z","timestamp":1202362265000},"page":"114-125","source":"Crossref","is-referenced-by-count":11,"title":["Assigning Sensors to Missions with Demands"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"La Porta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hosam","family":"Rowaihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. In: Proceedings of SWAT, pp. 214\u2013219 (2000)","DOI":"10.1007\/3-540-44985-X_19"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Byers, J., Nasser, G.: Utility-based decision-making in wireless sensor networks. In: Proceedings of the IEEE Workshop on Mobile and Ad Hoc Networking and Computing (2000)","DOI":"10.1109\/MOBHOC.2000.869228"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. Clark","year":"1990","unstructured":"Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Math\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Math"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15-3","author":"S. Vries de","year":"2003","unstructured":"de Vries, S., Vohra, R.V.: Combinatorial auctions: a survey. INFORMS J. on Computing\u00a015-3, 284\u2013309 (2003)","journal-title":"INFORMS J. on Computing"},{"key":"11_CR6","unstructured":"Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks (manuscript) (2001)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proceedings of SODA 2006, pp. 611\u2013620 (2006)","DOI":"10.1145\/1109557.1109624"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0215009","volume":"15","author":"Z. Galil","year":"1986","unstructured":"Galil, Z., Micali, S., Gabow, H.N.: An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput.\u00a015(1), 120\u2013130 (1986)","journal-title":"SIAM J. Comput."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. Hastad","year":"1999","unstructured":"Hastad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity\u00a015(1), 20\u201339 (2006)","journal-title":"Computational Complexity"},{"issue":"1","key":"11_CR11","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. J. ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"11_CR12","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.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"J. Algorithms"},{"issue":"6","key":"11_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TAES.2006.1603409","volume":"42","author":"L. Kaplan","year":"2006","unstructured":"Kaplan, L.: Global node selection for localization in a distributed sensor network. IEEE Transactions on Aerospace and Electronic Systems\u00a042(1), 113\u2013135 (2006)","journal-title":"IEEE Transactions on Aerospace and Electronic Systems"},{"key":"11_CR15","volume-title":"Combinatorial Auctions","author":"D. Lehmann","year":"2006","unstructured":"Lehmann, D., Mueller, R., Sandholm, T.: The winner determination problem. In: Cramton, Shoham, Steinberg (eds.) Combinatorial Auctions, MIT Press, Cambridge (2006)"},{"issue":"1-2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(96)00008-4","volume":"174","author":"M.V. Marathe","year":"1997","unstructured":"Marathe, M.V., Radhakrishnan, V., Hunt III, H.B., Ravi, S.S.: Hierarchically specified unit disk graphs. Theor. Comput. Sci.\u00a0174(1-2), 23\u201365 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Proceedings of the Japan Conference on Discrete and Computational Geometry, pp. 194\u2013200 (1998)","DOI":"10.1007\/978-3-540-46515-7_16"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MIS.2006.23","volume":"21","author":"T. Mullen","year":"2006","unstructured":"Mullen, T., Avasarala, V., Hall, D.L.: Customer-driven sensor management. IEEE Intelligent Systems\u00a021(2), 41\u201349 (2006)","journal-title":"IEEE Intelligent Systems"},{"key":"11_CR19","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. J. Comput. System Sci.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Perillo, M., Heinzelman, W.: Optimal sensor management under energy and reliability constraints. In: Proceedings of the IEEE Conference on Wireless Communications and Networking (2003)","DOI":"10.1109\/WCNC.2003.1200629"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Rowaihy, H., Eswaran, S., Johnson, M., Verma, D., Bar-Noy, A., Brown, T., La Porta, T.: A survey of sensor selection schemes in wireless sensor networks. In: SPIE Defense and Security Symposium Conference on Unattended Ground, Sea, and Air Sensor Technologies and Applications IX (2007)","DOI":"10.1117\/12.723514"},{"key":"11_CR22","unstructured":"Shih, K., Chen, Y., Chiang, C., Liu, B.: A distributed active sensor selection scheme for wireless sensor networks. In: Proceedings of the IEEE Symposium on Computers and Communications (June 2006)"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8-5","author":"S.C. Sung","year":"2005","unstructured":"Sung, S.C., Vlach, M.: Maximizing weighted number of just-in-time jobs on unrelated parallel machines. J. Scheduling\u00a08-5, 453\u2013460 (2005)","journal-title":"J. Scheduling"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/79.985685","volume":"19","author":"F. Zhao","year":"2002","unstructured":"Zhao, F., Shin, J., Reich, J.: Information-driven dynamic sensor collaboration. IEEE Signal Processing Magazine\u00a019(2), 61\u201372 (2002)","journal-title":"IEEE Signal Processing Magazine"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77871-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T18:56:42Z","timestamp":1557255402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77871-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540778707","9783540778714"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77871-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}