{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:19:34Z","timestamp":1775150374233,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T00:00:00Z","timestamp":1672272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T00:00:00Z","timestamp":1672272000000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s11432-021-3291-3","type":"journal-article","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T08:02:40Z","timestamp":1672473760000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Toward the minimum vertex cover of complex networks using distributed potential games"],"prefix":"10.1007","volume":"66","author":[{"given":"Jie","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,29]]},"reference":[{"key":"3291_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D S Hochbaum","year":"1982","unstructured":"Hochbaum D S. Approximation algorithms for the set covering and vertex cover problems. SIAM J Comput, 1982, 11: 555\u2013556","journal-title":"SIAM J Comput"},{"key":"3291_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TMC.2011.262","volume":"12","author":"E Xu","year":"2013","unstructured":"Xu E, Ding Z, Dasgupta S. Target tracking and mobile sensor navigation in wireless sensor networks. IEEE Trans Mobile Comput, 2013, 12: 177\u2013186","journal-title":"IEEE Trans Mobile Comput"},{"key":"3291_CR3","doi-asserted-by":"publisher","first-page":"2028","DOI":"10.1109\/TCYB.2015.2460261","volume":"46","author":"Y Tan","year":"2016","unstructured":"Tan Y, Ding K. A survey on GPU-based implementation of swarm intelligence algorithms. IEEE Trans Cybern, 2016, 46: 2028\u20132041","journal-title":"IEEE Trans Cybern"},{"key":"3291_CR4","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TITS.2017.2766682","volume":"19","author":"J J Q Yu","year":"2018","unstructured":"Yu J J Q, Lam A Y S. Autonomous vehicle logistic system: joint routing and charging strategy. IEEE Trans Intell Transp Syst, 2018, 19: 2175\u20132187","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"3291_CR5","doi-asserted-by":"publisher","first-page":"5401","DOI":"10.1109\/JIOT.2020.2979169","volume":"7","author":"J A Ansere","year":"2020","unstructured":"Ansere J A, Han G, Liu L, et al. Optimal resource allocation in energy-efficient Internet-of-Things networks with imperfect CSI. IEEE Internet Things J, 2020, 7: 5401\u20135411","journal-title":"IEEE Internet Things J"},{"key":"3291_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1109\/TMC.2009.143","volume":"9","author":"X L Bai","year":"2010","unstructured":"Bai X L, Yun Z Q, Xuan D, et al. Optimal patterns for four-connectivity and full coverage in wireless sensor networks. IEEE Trans Mobile Comput, 2010, 9: 435\u2013448","journal-title":"IEEE Trans Mobile Comput"},{"key":"3291_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(85)90057-5","volume":"10","author":"D Coppersmith","year":"1985","unstructured":"Coppersmith D, Vishkin U. Solving NP-hard problems in \u2018almost trees\u2019: vertex cover. Discrete Appl Math, 1985, 10: 27\u201345","journal-title":"Discrete Appl Math"},{"key":"3291_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D J Watts","year":"1998","unstructured":"Watts D J, Strogatz S H. Collective dynamics of \u2018small-world\u2019 networks. Nature, 1998, 393: 440\u2013442","journal-title":"Nature"},{"key":"3291_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A L, Albert R. Emergence of scaling in random networks. Science, 1999, 286: 509\u2013512","journal-title":"Science"},{"key":"3291_CR10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MCAS.2003.1228503","volume":"3","author":"X F Wang","year":"2003","unstructured":"Wang X F, Chen G R. Complex networks: small-world, scale-free and beyond. IEEE Circ Syst Mag, 2003, 3: 6\u201320","journal-title":"IEEE Circ Syst Mag"},{"key":"3291_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M E J Newman","year":"2003","unstructured":"Newman M E J. The structure and function of complex networks. SIAM Rev, 2003, 45: 167\u2013256","journal-title":"SIAM Rev"},{"key":"3291_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti S, Latora V, Moreno Y, et al. Complex networks: structure and dynamics. Phys Rep, 2006, 424: 175\u2013308","journal-title":"Phys Rep"},{"key":"3291_CR13","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E Halperin","year":"2002","unstructured":"Halperin E. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J Comput, 2002, 31: 1608\u20131623","journal-title":"SIAM J Comput"},{"key":"3291_CR14","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/11523468_84","volume-title":"Proceedings of International Colloquium on Automata, Languages, and Programming","author":"G Karakostas","year":"2005","unstructured":"Karakostas G. A better approximation ratio for the vertex cover problem. In: Proceedings of International Colloquium on Automata, Languages, and Programming. Berlin: Springer, 2005. 1043\u20131050"},{"key":"3291_CR15","first-page":"072107","volume":"57","author":"J X Wang","year":"2014","unstructured":"Wang J X, Li W J, Li S H, et al. On the parameterized vertex cover problem for graphs with perfect matching. Sci China Inf Sci, 2014, 57: 072107","journal-title":"Sci China Inf Sci"},{"key":"3291_CR16","doi-asserted-by":"publisher","first-page":"064612","DOI":"10.1007\/s11433-017-9164-6","volume":"61","author":"Z P Qiu","year":"2018","unstructured":"Qiu Z P, Wang P B. Parameter vertex method and its parallel solution for evaluating the dynamic response bounds of structures with interval parameters. Sci China Phys Mech Astron, 2018, 61: 064612","journal-title":"Sci China Phys Mech Astron"},{"key":"3291_CR17","unstructured":"Khuri S, B\u00e4ck T. An evolutionary heuristic for the minimum vertex cover problem. In: Proceedings of Genetic Algorithms within the Framework of Evolutionary Computation, 1994. 86\u201390"},{"key":"3291_CR18","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2013","unstructured":"Kratsch S, Neumann F. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica, 2013, 65: 754\u2013771","journal-title":"Algorithmica"},{"key":"3291_CR19","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"P S Oliveto","year":"2009","unstructured":"Oliveto P S, He J, Yao X. Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems. IEEE Trans Evol Computat, 2009, 13: 1006\u20131029","journal-title":"IEEE Trans Evol Computat"},{"key":"3291_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich T, He J, Hebbinghaus N, et al. Approximating covering problems by randomized search heuristics using multi-objective models. Evolary Computation, 2010, 18: 617\u2013633","journal-title":"Evolary Computation"},{"key":"3291_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TNB.2014.2375356","volume":"14","author":"W-L Chang","year":"2015","unstructured":"Chang W-L, Ren T-T, Feng M. Quantum algorithms and mathematical formulations of biomolecular solutions of the vertex cover problem in the finite-dimensional hilbert space. IEEE Transon Nanobiosci, 2015, 14: 121\u2013128","journal-title":"IEEE Transon Nanobiosci"},{"key":"3291_CR22","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1360\/N012017-00012","volume":"47","author":"H S Li","year":"2017","unstructured":"Li H S. Quantum vertex algebras and quantum affine algebras. Sci Sin Math, 2017, 47: 1423\u20131440","journal-title":"Sci Sin Math"},{"key":"3291_CR23","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1103\/PhysRevLett.86.1658","volume":"86","author":"M Weigt","year":"2001","unstructured":"Weigt M, Hartmann A K. Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. Phys Rev Lett, 2001, 86: 1658\u20131661","journal-title":"Phys Rev Lett"},{"key":"3291_CR24","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TSMCB.2012.2218805","volume":"43","author":"Y Yang","year":"2013","unstructured":"Yang Y, Li X. Towards a snowdrift game optimization to vertex cover of networks. IEEE Trans Cybern, 2013, 43: 948\u2013956","journal-title":"IEEE Trans Cybern"},{"key":"3291_CR25","doi-asserted-by":"crossref","unstructured":"Li A, Tang C B, Li X. An evolutionary game optimization to vertex cover of dynamic networks. In: Proceedings of the 33rd Chinese Control Conference, 2014. 2757\u20132762","DOI":"10.1109\/ChiCC.2014.6897074"},{"key":"3291_CR26","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1109\/TCYB.2017.2754919","volume":"48","author":"C Tang","year":"2018","unstructured":"Tang C, Li A, Li X. Asymmetric game: a silver bullet to weighted vertex cover of networks. IEEE Trans Cybern, 2018, 48: 2994\u20133005","journal-title":"IEEE Trans Cybern"},{"key":"3291_CR27","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1109\/TCYB.2018.2817631","volume":"49","author":"C Sun","year":"2019","unstructured":"Sun C, Sun W, Wang X, et al. Potential game theoretic learning for the minimal weighted vertex cover in distributed networking systems. IEEE Trans Cybern, 2019, 49: 1968\u20131978","journal-title":"IEEE Trans Cybern"},{"key":"3291_CR28","doi-asserted-by":"crossref","unstructured":"Vetta A. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. 416\u2013425","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"3291_CR29","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1115\/1.2766722","volume":"129","author":"G Arslan","year":"2007","unstructured":"Arslan G, Marden J R, Shamma J S. Autonomous vehicle-target assignment: a game-theoretical formulation. J Dynamic Syst Measurement Control, 2007, 129: 584\u2013596","journal-title":"J Dynamic Syst Measurement Control"},{"key":"3291_CR30","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J F Nash","year":"1950","unstructured":"Nash J F. Equilibrium points in n-person games. Proc Natl Acad Sci USA, 1950, 36: 48\u201349","journal-title":"Proc Natl Acad Sci USA"},{"key":"3291_CR31","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley L S. Potential games. Games Economic Behav, 1996, 14: 124\u2013143","journal-title":"Games Economic Behav"},{"key":"3291_CR32","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0305004100033399","volume":"54","author":"J Hajnal","year":"1958","unstructured":"Hajnal J, Bartlett M S. Weak ergodicity in non-homogeneous Markov chains. Math Proc Camb Phil Soc, 1958, 54: 233\u2013246","journal-title":"Math Proc Camb Phil Soc"},{"key":"3291_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/1101006","volume":"1","author":"R L Dobrushin","year":"1956","unstructured":"Dobrushin R L. Central limit theorem for nonstationary Markov chains. I. Theor Probab Appl, 1956, 1: 65\u201380","journal-title":"Theor Probab Appl"},{"key":"3291_CR34","volume-title":"Markov Chains: Theory and Applications","author":"D L Isaacson","year":"1976","unstructured":"Isaacson D L, Madsen R W. Markov Chains: Theory and Applications. New York: Wiley, 1976"},{"key":"3291_CR35","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TSMCB.2009.2035100","volume":"40","author":"B An","year":"2010","unstructured":"An B, Lesser V. Characterizing contract-based multiagent resource allocation in networks. IEEE Trans Syst Man Cybern B, 2010, 40: 575\u2013586","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"3291_CR36","doi-asserted-by":"publisher","DOI":"10.1515\/9780691214252","volume-title":"Individual Strategy and Social Structure: An Evolutionary Theory of Institutions","author":"P H Young","year":"1998","unstructured":"Young P H. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. Princeton: Princeton University Press, 1998"},{"key":"3291_CR37","doi-asserted-by":"crossref","unstructured":"Tatarenko T. Log-linear learning: convergence in discrete and continuous strategy potential games. In: Proceedings of the 53rd IEEE Conference on Decision and Control, 2014. 426\u2013432","DOI":"10.1109\/CDC.2014.7039418"},{"key":"3291_CR38","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A. On the evolution of random graphs. Publ Math Inst Hung Acad Sci, 1960, 5: 17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"3291_CR39","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2007.04.004","volume":"446","author":"G Szab\u00f3","year":"2007","unstructured":"Szab\u00f3 G, F\u00e1th G. Evolutionary games on graphs. Phys Rep, 2007, 446: 97\u2013216","journal-title":"Phys Rep"},{"key":"3291_CR40","doi-asserted-by":"publisher","first-page":"57","DOI":"10.2307\/2951778","volume":"61","author":"H P Young","year":"1993","unstructured":"Young H P. The evolution of conventions. Econometrica, 1993, 61: 57\u201384","journal-title":"Econometrica"},{"key":"3291_CR41","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1109\/TCYB.2018.2789930","volume":"49","author":"J Wu","year":"2019","unstructured":"Wu J, Shen X, Jiao K. Game-based memetic algorithm to the vertex cover of networks. IEEE Trans Cybern, 2019, 49: 974\u2013988","journal-title":"IEEE Trans Cybern"},{"key":"3291_CR42","first-page":"218","volume":"4","author":"H Bhasin","year":"2012","unstructured":"Bhasin H, Ahuja G. Harnessing genetic algorithm for vertex cover problem. Int J Comput Sci Eng, 2012, 4: 218\u2013223","journal-title":"Int J Comput Sci Eng"},{"key":"3291_CR43","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/3477.485836","volume":"26","author":"J M Renders","year":"1996","unstructured":"Renders J M, Flasse S P. Hybrid methods using genetic algorithms for global optimization. IEEE Trans Syst Man Cybern B, 1996, 26: 243\u2013258","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"3291_CR44","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1109\/TSMCB.2003.818557","volume":"34","author":"C F Juang","year":"2004","unstructured":"Juang C F. A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. IEEE Trans Syst Man Cybern B, 2004, 34: 997\u20131006","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"3291_CR45","doi-asserted-by":"crossref","unstructured":"Luo C, Hoos H H, Cai S, et al. Local search with efficient automatic configuration for minimum vertex cover. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, 2019. 1297\u20131304","DOI":"10.24963\/ijcai.2019\/180"},{"key":"3291_CR46","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/9.159572","volume":"37","author":"M S Radenkovic","year":"1992","unstructured":"Radenkovic M S, Michel A. Robust adaptive systems and self stabilization. IEEE Trans Automat Contr, 1992, 37: 1355\u20131369","journal-title":"IEEE Trans Automat Contr"},{"key":"3291_CR47","doi-asserted-by":"publisher","first-page":"3338","DOI":"10.1109\/TPDS.2016.2536023","volume":"27","author":"A Klinkhamer","year":"2016","unstructured":"Klinkhamer A, Ebnenasir A. Shadow\/puppet synthesis: a stepwise method for the design of self-stabilization. IEEE Trans Parallel Distrib Syst, 2016, 27: 3338\u20133350","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3291-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3291-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3291-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T08:05:50Z","timestamp":1728633950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3291-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,29]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["3291"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3291-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,29]]},"assertion":[{"value":"9 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"112205"}}