{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:44Z","timestamp":1759638944001,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_15","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"183-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Approximation Algorithms for the Connected Sensor Cover Problem"],"prefix":"10.1007","author":[{"given":"Lingxiao","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qicai","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"issue":"1","key":"15_CR2","first-page":"463","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite vc-dimension. DCG 14(1), 463\u2013479 (1995)","journal-title":"DCG"},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SICOMP 40(6), 1740\u20131766 (2011)","journal-title":"SICOMP"},{"issue":"3","key":"15_CR4","first-page":"281","volume":"9","author":"G Calinescu","year":"2005","unstructured":"Calinescu, G., Zelikovsky, A.: The polymatroid steiner problems. JCO 9(3), 281\u2013294 (2005)","journal-title":"JCO"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Grant, E., K\u00f6nemann, J., Sharpe, M.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: SODA, pp. 1576\u20131585. SIAM (2012)","DOI":"10.1137\/1.9781611973099.125"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2005.07.010","volume":"154","author":"C Chekuri","year":"2006","unstructured":"Chekuri, C., Even, G., Kortsarz, G.: A greedy approximation algorithm for the group steiner problem. Discrete Applied Mathematics 154(1), 15\u201334 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"Cheng, X., Huang, X., Li, D., Wu, W., Du, D.Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202\u2013208 (2003)","journal-title":"Networks"},{"issue":"1","key":"15_CR8","first-page":"43","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. DCG 37(1), 43\u201358 (2007)","journal-title":"DCG"},{"issue":"8","key":"15_CR9","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.tcs.2008.11.015","volume":"410","author":"D Dai","year":"2009","unstructured":"Dai, D., Yu, C.: A 5+ $$\\epsilon $$-approximation algorithm for minimum weighted dominating set in unit disk graph. TCS 410(8), 756\u2013765 (2009)","journal-title":"TCS"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 624\u2013633. ACM (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Wan, P.J.: Connected Dominating Set: Theory and Applications, vol. 77. Springer Science & Business Media (2012)","DOI":"10.1007\/978-1-4614-5242-3_5"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ipl.2005.03.010","volume":"95","author":"G Even","year":"2005","unstructured":"Even, G., Rawitz, D., Shahar, S.M.: Hitting sets when the vc-dimension is small. IPL 95(2), 358\u2013362 (2005)","journal-title":"IPL"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC, pp. 448\u2013455. ACM (2003)","DOI":"10.1145\/780542.780608"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. JACM 45(4), 634\u2013652 (1998)","journal-title":"JACM"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the k-mst problem in graphs. In: STOC, pp. 396\u2013402. ACM (2005)","DOI":"10.1145\/1060590.1060650"},{"key":"15_CR16","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group steiner tree problem. In: SODA, pp. 253\u2013259. SIAM (1998)"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SICOMP 24(2), 296\u2013317 (1995)","journal-title":"SICOMP"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and computation 150(1), 57\u201374 (1999)","journal-title":"Information and computation"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TNET.2005.863478","volume":"14","author":"H Gupta","year":"2006","unstructured":"Gupta, H., Zhou, Z., Das, S.R., Gu, Q.: Connected sensor cover: self-organization of sensor networks for efficient query execution. IEEE\/ACM Transactions on Networking 14(1), 55\u201367 (2006)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"15_CR20","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics 45(6), 615\u2013627 (1998)","journal-title":"Naval Research Logistics"},{"issue":"2","key":"15_CR21","first-page":"179","volume":"18","author":"Y Huang","year":"2009","unstructured":"Huang, Y., Gao, X., Zhang, Z., Wu, W.: A better constant-factor approximation for weighted dominating set in unit disk graph. JCO 18(2), 179\u2013194 (2009)","journal-title":"JCO"},{"key":"15_CR22","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting steiner tree problem: theory and practice. In: SODA, vol. 1, p. 4. Citeseer (2000)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Khuller, S., Purohit, M., Sarpatwar, K.K.: Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems. In: SODA, pp. 1702\u20131713. SIAM (2014)","DOI":"10.1137\/1.9781611973402.123"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms 19(1), 104\u2013115 (1995)","journal-title":"Journal of Algorithms"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Kuo, T.W., Lin, K.J., Tsai, M.J.: Maximizing submodular set function with connectivity constraint: theory and application to networks. In: INFOCOM, pp. 1977\u20131985. IEEE (2013)","DOI":"10.1109\/INFCOM.2013.6566998"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1007\/978-3-662-47672-7_73","volume-title":"Automata, Languages, and Programming","author":"J Li","year":"2015","unstructured":"Li, J., Jin, Y.: A PTAS for the weighted unit disk cover problem. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 898\u2013909. Springer, Heidelberg (2015)"},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SICOMP 11(2), 329\u2013343 (1982)","journal-title":"SICOMP"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H., Ray, S.: PTAS for geometric hitting set problems via local search. In: SCG, pp. 17\u201322. ACM (2009)","DOI":"10.1145\/1542362.1542367"},{"issue":"1","key":"15_CR29","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Mathematical Programming 14(1), 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Ray, S.: New existence proofs $$\\varepsilon $$-nets. In: SCG, pp. 199\u2013207. ACM (2008)","DOI":"10.1145\/1377676.1377708"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.: Weighted geometric set cover via quasi-uniform sampling. In: STOC, pp. 641\u2013648. ACM (2010)","DOI":"10.1145\/1806689.1806777"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J., Chekuri, C., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. In: STOC, pp. 783\u2013792. ACM (2011)","DOI":"10.1145\/1993636.1993740"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: INFOCOM, vol. 3, pp. 1597\u20131604. IEEE (2002)","DOI":"10.1145\/513800.513820"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"15_CR35","unstructured":"Willson, J., Ding, L., Wu, W., Wu, L., Lu, Z., Lee, W.: A better constant-approximation for coverage problem in wireless sensor networks (preprint)"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Wu, L., Du, H., Wu, W., Li, D., Lv, J., Lee, W.: Approximations for minimum connected sensor covereq:cellsum. In: INFOCOM, pp. 1187\u20131194. IEEE (2013)","DOI":"10.1109\/INFCOM.2013.6566910"},{"issue":"3","key":"15_CR37","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10898-011-9726-x","volume":"53","author":"W Zhang","year":"2012","unstructured":"Zhang, W., Wu, W., Lee, W., Du, D.Z.: Complexity and approximation of the connected set-cover problem. Journal of Global Optimization 53(3), 563\u2013572 (2012)","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"15_CR38","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.tcs.2009.06.022","volume":"412","author":"F Zou","year":"2011","unstructured":"Zou, F., Wang, Y., Xu, X.H., Li, X., Du, H., Wan, P., Wu, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. TCS 412(3), 198\u2013208 (2011)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:31:25Z","timestamp":1675272685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}