{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:40:11Z","timestamp":1746070811058,"version":"3.40.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038889"},{"type":"electronic","value":"9783319038896"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03889-6_18","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T06:27:22Z","timestamp":1386570442000},"page":"157-164","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs"],"prefix":"10.1007","author":[{"given":"Liang","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Kadowaki","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Datta, A.K., Devismes, S., Heurtefeux, K., Larmore, L.L., Rivierre, Y.: Self-Stabilizing Small k-Dominating Sets. Verimag Research Report TR-2011-6 (2011)","DOI":"10.1109\/ICNC.2011.15"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Eto, H., Guo, F., Miyano, E.: Distance-d independent set problems for bipartite and chordal graphs. J. Combinatorial Optimization (2013)","DOI":"10.1007\/978-3-642-31770-5_21"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, A., Diallo, C., Marot, M., Becker, M.: Understanding Topology Challenges in the Implementation of Wireless Sensor Network for Cold Chain. In: Proc. 2010 IEEE Radio and Wireless Symposium, pp. 376\u2013379 (2010)","DOI":"10.1109\/RWS.2010.5434224"},{"issue":"7","key":"18_CR4","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"W. Goddard","year":"2013","unstructured":"Goddard, W., Henning, M.A.: Independent domination in graphs: A survey and recent results. Discrete Mathematics\u00a0313(7), 839\u2013854 (2013)","journal-title":"Discrete Mathematics"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(93)90022-2","volume":"46","author":"M.M. Halldorsson","year":"1993","unstructured":"Halldorsson, M.M.: Approximating the minimum maximal independence number. Inform. Process. Lett.\u00a046, 169\u2013172 (1993)","journal-title":"Inform. Process. Lett."},{"key":"18_CR6","volume-title":"Fundamentals of domination in graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of domination in graphs. Marcel Dekker, Inc., New York (1998)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Hurink, J.L., Neiberg, T.: Approximating Minimum Independent Dominating Sets in Wireless Networks. Information Processing Letters, 155\u2013160 (2008)","DOI":"10.1016\/j.ipl.2008.09.021"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks\u00a025(2), 59\u201368 (1995)","journal-title":"Networks"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-03417-6_4","volume-title":"Wireless Algorithms, Systems, and Applications","author":"D. Mahjoub","year":"2009","unstructured":"Mahjoub, D., Matula, D.W.: Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms. In: Liu, B., Bestavros, A., Du, D.-Z., Wang, J. (eds.) WASA 2009. LNCS, vol.\u00a05682, pp. 32\u201342. Springer, Heidelberg (2009)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Molnar Jr., F., Screenivasan, S., Szymanski, B.K., Korniss, G.: Minimum Dominating Sets in Scale-Free Network Ensembles. Scientific Reports 3, 1736 (2013)","DOI":"10.1038\/srep01736"},{"key":"18_CR12","unstructured":"Poghosyan, A.: The probabilistic method for upper bounds in domination theory, doctoral thesis, University of the West of England (2010)"},{"key":"18_CR13","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-22606-9_10","volume-title":"Contemporary Computing","author":"A. Potluri","year":"2011","unstructured":"Potluri, A., Negi, A.: Some Observations on Algorithms for Computing Minimum Independent Dominating Set. In: Aluru, S., Bandyopadhyay, S., Catalyurek, U.V., Dubhashi, D.P., Jones, P.H., Parashar, M., Schmidt, B. (eds.) IC3 2011. CCIS, vol.\u00a0168, pp. 57\u201368. Springer, Heidelberg (2011)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proc. 29th STOC, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Sasaki, M., Zhao, L., Nagamochi, H.: Security-aware beacon based network monitoring. In: 11th IEEE International Conference on Communication Systems, Guangzhou, China, pp. 527\u2013531 (2008)","DOI":"10.1109\/ICCS.2008.4737240"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Wang, J., Gim, J., Sasaki, M., Zhao, L., Nagamochi, H.: Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract). In: International Conf. on Computational Intelligence and Software Engineering (CiSE), Wuhan, China, pp. 1\u20134 (2009)","DOI":"10.1109\/CISE.2009.5366567"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03889-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:24:15Z","timestamp":1746069855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03889-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038889","9783319038896"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03889-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}