{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T17:12:08Z","timestamp":1675789928364},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T00:00:00Z","timestamp":1286409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10878-010-9359-x","type":"journal-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T22:51:56Z","timestamp":1286319116000},"page":"451-461","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial time approximation scheme for t-latency bounded information propagation problem in\u00a0wireless\u00a0networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonjun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,7]]},"reference":[{"key":"9359_CR1","first-page":"265","volume-title":"Proc FOCS","author":"BS Baker","year":"1983","unstructured":"Baker BS (1983) Approximation algorithms for NP-complete problems on planar graphs. In: Proc FOCS, pp 265\u2013273"},{"key":"9359_CR2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"XZ Cheng","year":"2003","unstructured":"Cheng XZ, Huang X, Li DY, Wu WL, Du DZ (2003) A polynomial-time approximation scheme for minimum-connected dominating set ad hoc wireless networks. Networks 42:202\u2013208","journal-title":"Networks"},{"key":"9359_CR3","volume-title":"Seventh international conference on knowledge discovery and data mining","author":"P Domingos","year":"2001","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Seventh international conference on knowledge discovery and data mining"},{"key":"9359_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining","author":"D Kempe","year":"2003","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146"},{"key":"9359_CR5","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Proc 32nd international colloquium on automata, languages and programming","author":"D Kempe","year":"2005","unstructured":"Kempe D, Kleinberg J, Tardos E (2005) Influential nodes in a diffusion model for social networks. In: Proc 32nd international colloquium on automata, languages and programming, pp 1127\u20131138"},{"key":"9359_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-62495-3_53","volume-title":"Proc symposium on graph drawing, GD\u201996","author":"J Kratochvil","year":"1997","unstructured":"Kratochvil J (1997) Intersection graphs of noncrossing arc-connected sets in the plane. In: Proc symposium on graph drawing, GD\u201996. LNCS, vol 1190, pp 257\u2013270"},{"key":"9359_CR7","first-page":"128","volume-title":"Proc. 39th annual ACM symposium on theory of computing","author":"E Mossel","year":"2007","unstructured":"Mossel E, Roch S (2007) Submodularity of influence in social networks: from local to global. In: Proc. 39th annual ACM symposium on theory of computing. New York, NY, USA, pp 128\u2013134"},{"key":"9359_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser G, Wolsey L, Fisher M (1978) An analysis of the approximations for maximizing submodular set functions. Math Program 14:265\u2013294","journal-title":"Math Program"},{"key":"9359_CR9","first-page":"152","volume-title":"Structure, information and communication complexity","author":"D Peleg","year":"1996","unstructured":"Peleg D (1996) Local majority voting, small coalitions and controlling monopolies in graphs: a eeview. In: Structure, information and communication complexity, pp 152\u2013169"},{"key":"9359_CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/98.760423","volume":"6","author":"EM Royer","year":"1999","unstructured":"Royer EM, Toh C-K (1999) A review of current routing protocols for ad hoc mobile wireless networks. IEEE Pers Commun 6:46\u201355","journal-title":"IEEE Pers Commun"},{"key":"9359_CR11","first-page":"519","volume-title":"Lecture notes in computer science","author":"F Zou","year":"2009","unstructured":"Zou F, Zhang Z, Wu WL (2009) Latency-bounded minimum influential node selection in social networks. In: Lecture notes in computer science, vol\u00a05682, pp 519\u2013526"},{"issue":"1","key":"9359_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1142\/S1793830910000528","volume":"2","author":"F Zou","year":"2010","unstructured":"Zou F, Willson JK, Zhang Z, Wu WL (2010) Fast information propagation in social networks. Discrete Math Algorithms Appl 2(1):125\u2013141","journal-title":"Discrete Math Algorithms Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9359-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9359-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9359-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9359-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,7]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9359"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9359-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,7]]}}}