{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:45:15Z","timestamp":1760708715622},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_7","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"71-81","source":"Crossref","is-referenced-by-count":7,"title":["Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Zhiwen","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-79719-7_4","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"A. Biere","year":"2008","unstructured":"Biere, A.: Adaptive restart strategies for conflict driven SAT solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 28\u201333. Springer, Heidelberg (2008)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K., Chen, Q.: EWLS: A New Local Search for Minimum Vertex Cover. Proc. of AAAI-2010, pp. 45\u201350 (2010)","DOI":"10.1609\/aaai.v24i1.7539"},{"issue":"9-10","key":"7_CR3","doi-asserted-by":"publisher","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.\u00a0175(9-10), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover. J. Artif. Intell. Res., 687\u2013716 (2013)","DOI":"10.1613\/jair.3907"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. of Math.\u00a0162(1) (2005)","DOI":"10.4007\/annals.2005.162.439"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Evans, I.: An evolutionary heuristic for the minimum vertex cover problem. In: Proc. of EP 1998, pp. 377\u2013386 (1998)","DOI":"10.1007\/BFb0040790"},{"key":"7_CR7","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting Combinatorial Search Through Randomization. In: Proc. of AAAI 1998, pp. 431\u2013438 (1998)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F. Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 233\u2013248. Springer, Heidelberg (2002)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-Prover 1-Round games. In: Proc. 34th ACM Symp. on Theory of Computing, STOC, pp. 767\u2013775 (May 2002)","DOI":"10.1145\/509907.510017"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Li, C., Quan, Z.: An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. In: Proc. of AAAI 2010, pp. 128\u2013133 (2010)","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Li, C., Fang, Z., Xu, K.: Combining maxsat reasoning and incremental upper bound for the maximum clique problem. In: Proc. of ICTAI 2013, pp. 939\u2013946 (2013)","DOI":"10.1109\/ICTAI.2013.143"},{"key":"7_CR12","unstructured":"Morris, P.: The breakout method for escaping from local minima. In: Proc. of AAAI 1993, pp. 40\u201345 (1993)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. Ostergard","year":"2002","unstructured":"Ostergard, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics\u00a0120, 197\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. J. Artif. Intell. Res (JAIR), 159\u2013185 (2006)","DOI":"10.1613\/jair.1815"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","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\u00a012(3), 303\u2013323 (2006)","journal-title":"J. Comb. Optim"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.disopt.2008.12.001","volume":"6","author":"W. Pullan","year":"2009","unstructured":"Pullan, W.: Optimisation of unweighted\/weighted maximum independent sets and minimum vertex covers. Discrete Optimization\u00a06, 214\u2013219 (2009)","journal-title":"Discrete Optimization"},{"key":"7_CR17","series-title":"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.\u00a04667, pp. 412\u2013426. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10817-005-9010-1","volume":"35","author":"J. Thornton","year":"2005","unstructured":"Thornton, J.: Clause weighting local search for sat. J. Autom.Reasoning\u00a035(1-3), 97\u2013142 (2005)","journal-title":"J. Autom.Reasoning"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E. Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments. Journal of Global Optimization\u00a037, 95\u2013111 (2007)","journal-title":"Journal of Global Optimization"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K. Xu","year":"2000","unstructured":"Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. J. Artif. Intell. Res (JAIR)\u00a012, 93\u2013103 (2000)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"8-9","key":"7_CR22","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K. Xu","year":"2007","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artif. Intell.\u00a0171(8-9), 514\u2013534 (2007)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T20:00:24Z","timestamp":1689278424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}