{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:53Z","timestamp":1740122393362,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T00:00:00Z","timestamp":1730073600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10878-024-01229-4","type":"journal-article","created":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T20:02:34Z","timestamp":1730145754000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On greedy approximation algorithm for the minimum resolving dominating set problem"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8960-5521","authenticated-orcid":false,"given":"Hao","family":"Zhong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,28]]},"reference":[{"issue":"12","key":"1229_CR1","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","volume":"24","author":"Z Beerliova","year":"2006","unstructured":"Beerliova Z, Eberhard F, Erlebach T et al (2006) Network discovery and verification. IEEE J Sel Areas Commun 24(12):2168\u20132181","journal-title":"IEEE J Sel Areas Commun"},{"issue":"1","key":"1229_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-021-00812-3","volume":"44","author":"W Chen","year":"2022","unstructured":"Chen W, Zhong H, Wu L et al (2022) A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks. J Comb Optim 44(1):1\u201320","journal-title":"J Comb Optim"},{"issue":"4","key":"1229_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TNSE.2016.2600030","volume":"3","author":"J Gao","year":"2016","unstructured":"Gao J, Zhao Q, Swami A (2016) The minimum information dominating set for opinion sampling in social networks. IEEE Trans Netw Sci Eng 3(4):299\u2013311","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1229_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jda.2011.12.010","volume":"14","author":"M Hauptmann","year":"2012","unstructured":"Hauptmann M, Schmied R, Viehmann C (2012) Approximation complexity of metric dimension problem. J Discrete Algorithm 14:214\u2013222","journal-title":"J Discrete Algorithm"},{"key":"1229_CR5","doi-asserted-by":"crossref","unstructured":"He J, Ji S, Beyah R et al (2014) Minimum-sized influential node set selection for social networks under the independent cascade model, Proceedings of the 15th ACM International Symposium on Mobile ad hoc Networking and Computing, 93-102. ACM, Philadelphia, PA, USA","DOI":"10.1145\/2632951.2632975"},{"key":"1229_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2020.05.005","volume":"853","author":"Y Huang","year":"2021","unstructured":"Huang Y, Hou B, Liu W et al (2021) On approximation algorithm for the edge metric dimension problem. Theoret Comput Sci 853:2\u20136","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"1229_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller S, Raghavachari B, Rosenfeld A (1996) Landmarks in graphs. Discret Appl Math 70(3):217\u2013229","journal-title":"Discret Appl Math"},{"issue":"1","key":"1229_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TCOMM.2020.3030930","volume":"69","author":"X Liang","year":"2020","unstructured":"Liang X, Liang J, Zhang W (2020) Constructing d-robust connected dominating sets in wireless sensor networks with unstable transmission ranges. IEEE Trans Commun 69(1):398\u2013415","journal-title":"IEEE Trans Commun"},{"key":"1229_CR9","first-page":"862","volume":"47","author":"G Monsanto","year":"2020","unstructured":"Monsanto G, Rara H (2020) Resolving sets in graphs. Int J Pure Appl Math 47:862\u2013871","journal-title":"Int J Pure Appl Math"},{"issue":"3","key":"1229_CR10","doi-asserted-by":"publisher","first-page":"829","DOI":"10.29020\/nybg.ejpam.v14i3.3985","volume":"14","author":"GB Monsanto","year":"2021","unstructured":"Monsanto GB, Rara HM (2021) Resolving restrained domination in graphs. Eur J Pure Appl Math 14(3):829\u2013841","journal-title":"Eur J Pure Appl Math"},{"issue":"4","key":"1229_CR11","doi-asserted-by":"publisher","first-page":"5049","DOI":"10.1109\/TVT.2022.3224304","volume":"72","author":"NL Prasad","year":"2022","unstructured":"Prasad NL, Ramkumar B (2022) 3-D deployment and trajectory planning for relay based UAV assisted cooperative communication for emergency scenarios using Dijkstra\u2019s algorithm. IEEE Trans Veh Technol 72(4):5049\u20135063","journal-title":"IEEE Trans Veh Technol"},{"key":"1229_CR12","first-page":"4381","volume":"8","author":"RC Sergio","year":"2014","unstructured":"Sergio RC, Gina AM, Dennis AT (2014) Locating-Dominating Sets in Graphs. Appl Math Sci 8:4381\u20134388","journal-title":"Appl Math Sci"},{"key":"1229_CR13","first-page":"2957","volume":"9","author":"O Stephanie","year":"2015","unstructured":"Stephanie O, Sergio CJ (2015) Locating sets in a graph. Appl Math Sci 9:2957\u20132964","journal-title":"Appl Math Sci"},{"issue":"2","key":"1229_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10589-009-9269-y","volume":"45","author":"PJ Wan","year":"2010","unstructured":"Wan PJ, Du DZ, Pardalos P et al (2010) Greedy approximations for minimum submodular cover with submodular cost. Comput Optim Appl 45(2):463\u2013474","journal-title":"Comput Optim Appl"},{"issue":"4","key":"1229_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey LA (1982) An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4):385\u2013393","journal-title":"Combinatorica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01229-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T11:05:07Z","timestamp":1730977507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01229-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,28]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1229"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01229-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,10,28]]},"assertion":[{"value":"17 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare that this paper is original and has not been published elsewhere previously.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animals participants"}}],"article-number":"35"}}