{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:59:23Z","timestamp":1770739163996,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,29]],"date-time":"2009-12-29T00:00:00Z","timestamp":1262044800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10898-009-9511-2","type":"journal-article","created":{"date-parts":[[2009,12,28]],"date-time":"2009-12-28T09:03:55Z","timestamp":1261991035000},"page":"633-642","source":"Crossref","is-referenced-by-count":34,"title":["New dominating sets in social networks"],"prefix":"10.1007","volume":"48","author":[{"given":"Xu","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonjun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,29]]},"reference":[{"key":"9511_CR1","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondrak, J.: Maximizing a submodular set function subject to a matroid constraint. In: Proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2007), pp. 182\u2013196 (2007)","DOI":"10.1007\/978-3-540-72792-7_15"},{"key":"9511_CR2","unstructured":"Du, D.-Z., Graham, R.L., Pardalos, P.M., Wan, P.-J., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Dicrete Algorithms (SODA). San Francisco, USA, Jan 20\u201322, pp. 167\u2013175 (2008)"},{"key":"9511_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(97)00023-1","volume":"78","author":"D.-Z. Du","year":"1997","unstructured":"Du D.-Z., Gao B., Wu W.: A special case for subset interconnection designs. Discret. Appl. Math. 78, 51\u201360 (1997)","journal-title":"Discret. Appl. Math."},{"key":"9511_CR4","unstructured":"Du, D.-Z., Ko, K.-I., Hu, X.: Design and Analysis of Approximation Algorithms, Lecture Notes (2008)"},{"key":"9511_CR5","volume-title":"Theory of Computational Complexity","author":"D.-Z. Du","year":"2000","unstructured":"Du D.-Z., Ko K.-I.: Theory of Computational Complexity. Wiley, New York (2000)"},{"issue":"4","key":"9511_CR6","doi-asserted-by":"crossref","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. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"9511_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S1793830909000105","volume":"1","author":"X. Gao","year":"2009","unstructured":"Gao X., Wang Y., Li X., Wu W.: Analysis on theoretical bonds for approximating dominating set problems. Discret. Math. Algorithms Appl. 1(1), 71\u201384 (2009)","journal-title":"Discret. Math. Algorithms Appl."},{"issue":"1","key":"9511_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/S1793830909000087","volume":"1","author":"D. Li","year":"2009","unstructured":"Li D., Liu L., Yang H.: Minimum connected r-hop k-dominating set in wireless networks. Discret. Math. Algorithms Appl. 1(1), 45\u201357 (2009)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"9511_CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L. Ruan","year":"2004","unstructured":"Ruan L., Du H., Jia X., Wu W., Li Y., Ko K.: A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329, 325\u2013330 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9511_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S1793830909000063","volume":"1","author":"A. Shioura","year":"2009","unstructured":"Shioura A.: On the pipage rounding algorithm for submodular function maximization: a view from discrete convex analysis. Discret. Math. Algorithms Appl. 1(1), 1\u201313 (2009)","journal-title":"Discret. Math. Algorithms Appl."},{"issue":"2","key":"9511_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1142\/S1793830909000221","volume":"1","author":"W. Wang","year":"2009","unstructured":"Wang W., Kim D., Sohaee N., Ma C., Wu W.: A PTAS for minimum d-hop underwater sink placement problem in 2-D underwater sensor networks. Discret. Math. Algorithms Appl. 1(2), 283\u2013289 (2009)","journal-title":"Discret. Math. Algorithms Appl."},{"issue":"2","key":"9511_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1142\/S1793830909000142","volume":"1","author":"W. Wang","year":"2009","unstructured":"Wang W., Kim D., Willson J., Thuraisingham B., Wu W.: A better approximation for minimum average routing path clustering problem in 2-D underwater sensor networks. Discret. Math. Algorithms Appl. 1(2), 175\u2013191 (2009)","journal-title":"Discret. Math. Algorithms Appl."},{"issue":"4","key":"9511_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey L.A.: An analysis of the greedy algorithm for submodular set covering problem. Combinatorica 2(4), 385\u2013393 (1982)","journal-title":"Combinatorica"},{"key":"9511_CR14","doi-asserted-by":"crossref","unstructured":"Zou, F., Zhang, Z., Wu, W.: Latency-bounded minimum influential node selection in social networks. In: Proceedings of Workshop on Social Networks, Applications, and Systems. Boston, Aug 16 (2009)","DOI":"10.1007\/978-3-642-03417-6_51"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9511-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-009-9511-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9511-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:55Z","timestamp":1559278735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-009-9511-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,29]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9511"],"URL":"https:\/\/doi.org\/10.1007\/s10898-009-9511-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,29]]}}}