{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:24:21Z","timestamp":1760171061952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687582"},{"type":"electronic","value":"9783319687599"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_13","type":"book-chapter","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T02:33:42Z","timestamp":1507862022000},"page":"145-157","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Local Search Algorithm for\u00a0Minimum Weighted Vertex Cover on\u00a0Massive Graphs"],"prefix":"10.1007","author":[{"given":"Yuanjie","family":"Li","sequence":"first","affiliation":[]},{"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Wenying","family":"Hou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bouamama, S., Blum, C., Boukerram, A.: A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 12, 1632\u20131639 (2012). Elsevier Science Publishers B. V","DOI":"10.1016\/j.asoc.2012.02.013"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: International Conference on Artificial Intelligence, pp. 747\u2013753 (2015)","DOI":"10.1609\/aaai.v29i1.9357"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K., Chen, Q.: EWLS: a new local search for minimum vertex cover. In: Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July (2010)","DOI":"10.1609\/aaai.v24i1.7539"},{"issue":"1","key":"13_CR4","first-page":"687","volume":"46","author":"S Cai","year":"2014","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Intell. Res. 46(1), 687\u2013716 (2014)","journal-title":"J. Artif. Intell. Res."},{"issue":"9\u201310","key":"13_CR5","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"issue":"3","key":"13_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"13_CR7","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"8","key":"13_CR8","doi-asserted-by":"crossref","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic, R., Tuba, M.: An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl. Soft Comput. 11(8), 5360\u20135366 (2011)","journal-title":"Appl. Soft Comput."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Katzmann, M., Komusiewicz, C.: Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem (2017)","DOI":"10.1609\/aaai.v31i1.10659"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"R Li","year":"2016","unstructured":"Li, R., Hu, S., Zhang, H., Yin, M.: An efficient local search framework for the minimum weighted vertex cover problem. Inf. Sci. 372, 428\u2013445 (2016)","journal-title":"Inf. Sci."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-42911-3_24","volume-title":"PRICAI 2016: Trends in Artificial Intelligence","author":"Z Ma","year":"2016","unstructured":"Ma, Z., Fan, Y., Su, K., Li, C., Sattar, A.: Local search with noisy strategy for minimum vertex cover in massive graphs. In: Booth, R., Zhang, M.-L. (eds.) PRICAI 2016. LNCS, vol. 9810, pp. 283\u2013294. Springer, Cham (2016). doi: 10.1007\/978-3-319-42911-3_24"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Ma, Z., Fan, Y., Su, K., Li, C., Sattar, A.: Random walk in large real-world graphs for finding smaller vertex cover. In: IEEE International Conference on TOOLS with Artificial Intelligence, pp. 686\u2013690 (2016)","DOI":"10.1109\/ICTAI.2016.0109"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-74565-5_31","volume-title":"KI 2007: Advances in Artificial Intelligence","author":"S Richter","year":"2007","unstructured":"Richter, S., Helmert, M., Gretton, C.: A stochastic local search approach to vertex cover. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 412\u2013426. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74565-5_31"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"SJ Shyu","year":"2004","unstructured":"Shyu, S.J., Yin, P.Y., Lin, B.M.T.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann. Oper. Res. 131(1), 283\u2013304 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"13_CR16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1142\/S0217595906000905","volume":"23","author":"A Singh","year":"2011","unstructured":"Singh, A., Gupta, A.K.: A hybrid heuristic for the minimum weight vertex cover problem. Asia-Pac. J. Oper. Res. (APJOR) 23(2), 273\u2013285 (2011)","journal-title":"Asia-Pac. J. Oper. Res. (APJOR)"},{"issue":"2","key":"13_CR17","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/s10878-015-9909-3","volume":"32","author":"T Zhou","year":"2016","unstructured":"Zhou, T., L\u00fc, Z., Wang, Y., Ding, J., Peng, B.: Multi-start iterated tabu search for the minimum weight vertex cover problem. J. Comb. Optim. 32(2), 368\u2013384 (2016)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T03:15:28Z","timestamp":1693106128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}