{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:47:43Z","timestamp":1762102063437},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319630038"},{"type":"electronic","value":"9783319630045"}],"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-63004-5_11","type":"book-chapter","created":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T21:34:07Z","timestamp":1499463247000},"page":"131-143","source":"Crossref","is-referenced-by-count":2,"title":["Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization"],"prefix":"10.1007","author":[{"given":"Wanru","family":"Gao","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,9]]},"reference":[{"key":"11_CR1","series-title":"Discrete Mathematics and Optimization","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Discrete Mathematics and Optimization. Wiley, Chichester (1997)"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.tcs.2015.09.023","volume":"609","author":"T Akiba","year":"2016","unstructured":"Akiba, T., Iwata, Y.: Branch-and-reduce exponential\/FPT algorithms in practice: a case study of vertex cover. Theor. Comput. Sci. 609, 211\u2013225 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-1-4614-6170-8_23","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"DA Bader","year":"2014","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Schulz, C., Kappes, A., Wagner, D.: Benchmarking for Graph Clustering and Partitioning. In: Alhajj, R., Rokne, J. (eds.) Encyclopedia of Social Network Analysis and Mining, pp. 73\u201382. Springer, New York (2014)"},{"unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 747\u2013753 (2015)","key":"11_CR4"},{"doi-asserted-by":"crossref","unstructured":"Cai, S., Lin, J., Su, K.: Two weighting local search for minimum vertex cover. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1107\u20131113 (2015)","key":"11_CR5","DOI":"10.1609\/aaai.v29i1.9357"},{"unstructured":"Cai, S., Su, K., Sattar, A.: Two new local search strategies for minimum vertex cover. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)","key":"11_CR6"},{"key":"11_CR7","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013)"},{"key":"11_CR8","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, San Francisco (2005)"},{"unstructured":"Johnson, D.J., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, 11\u201313 October 1993. American Mathematical Society, Boston (1996)","key":"11_CR9"},{"doi-asserted-by":"crossref","unstructured":"Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Finding near-optimal independent sets at scale. In: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, 10 January 2016, pp. 138\u2013150 (2016)","key":"11_CR10","DOI":"10.1137\/1.9781611974317.12"},{"issue":"3","key":"11_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10878-006-9635-y","volume":"12","author":"W Pullan","year":"2006","unstructured":"Pullan, W.: Phased local search for the maximum clique problem. J. Comb. Optim. 12(3), 303\u2013323 (2006)","journal-title":"J. Comb. Optim."},{"key":"11_CR12","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"},{"doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, pp. 4292\u20134293 (2015). http:\/\/networkrepository.com","key":"11_CR13","DOI":"10.1609\/aaai.v29i1.9277"},{"unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A simple model to generate hard satisfiable instances. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 337\u2013342 (2005)","key":"11_CR14"},{"unstructured":"Zhang, W., Rangan, A., Looks, M.: Backbone guided local search for maximum satisfiability. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 1179\u20131186 (2003)","key":"11_CR15"}],"container-title":["Lecture Notes in Computer Science","AI 2017: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63004-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T12:18:49Z","timestamp":1659183529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63004-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319630038","9783319630045"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63004-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}