{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:11:02Z","timestamp":1763727062876},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458229"},{"type":"electronic","value":"9783319458236"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_68","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"729-739","source":"Crossref","is-referenced-by-count":8,"title":["Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Mojgan","family":"Pourhassan","sequence":"first","affiliation":[]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"issue":"4","key":"68_CR1","doi-asserted-by":"crossref","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 65(4), 754\u2013771 (2013)","journal-title":"Algorithmica"},{"key":"68_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity, 1st edn. Springer, New York (2010)","edition":"1"},{"key":"68_CR3","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc., River Edge (2011)"},{"key":"68_CR4","series-title":"Natural Computing Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. NCS. Springer, Berlin (2013)"},{"key":"68_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-642-32937-1_6","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"AM Sutton","year":"2012","unstructured":"Sutton, A.M., Neumann, F.: A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol. 7491, pp. 52\u201361. Springer, Heidelberg (2012)"},{"issue":"4","key":"68_CR6","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1162\/EVCO_a_00119","volume":"22","author":"AM Sutton","year":"2014","unstructured":"Sutton, A.M., Neumann, F., Nallaperuma, S.: Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem. Evol. Comput. 22(4), 595\u2013628 (2014)","journal-title":"Evol. Comput."},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. In: Proceedings of 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 797\u2013804. ACM, New York (2007)","DOI":"10.1145\/1276958.1277118"},{"issue":"1","key":"68_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1162\/evco.2009.17.1.3","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Analyses of simple hybrid algorithms for the vertex cover problem. Evol. Comput. 17(1), 3\u201319 (2009)","journal-title":"Evol. Comput."},{"issue":"5","key":"68_CR9","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS 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. Comput. 13(5), 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"68_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, T., Oliveto, P.S., Zarges, C.: Approximating vertex cover using edge-based representations. In: Neumann, F., Jong, K.A.D. (eds.) Foundations of Genetic Algorithms XII, FOGA 2013, Adelaide, SA, Australia, 16\u201320 January 2013, pp. 87\u201396. ACM (2013)","DOI":"10.1145\/2460239.2460248"},{"key":"68_CR11","doi-asserted-by":"crossref","unstructured":"Pourhassan, M., Gao, W., Neumann, F.: Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, pp. 903\u2013910. ACM (2015)","DOI":"10.1145\/2739480.2754700"},{"issue":"3","key":"68_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M Laumanns","year":"2002","unstructured":"Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining convergence and diversity in evolutionary multiobjective optimization. Evol. Comput. 10(3), 263\u2013282 (2002)","journal-title":"Evol. Comput."},{"key":"68_CR13","doi-asserted-by":"crossref","unstructured":"Horoba, C., Neumann, F.: Benefits and drawbacks for the use of $$\\epsilon $$ -dominance in evolutionary multi-objective optimization. In: Proceedings of GECCO 2008 (2008)","DOI":"10.1145\/1389095.1389224"},{"issue":"3","key":"68_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00453-009-9370-8","volume":"59","author":"F Neumann","year":"2011","unstructured":"Neumann, F., Reichel, J., Skutella, M.: Computing minimum cuts by randomized search heuristics. Algorithmica 59(3), 323\u2013342 (2011)","journal-title":"Algorithmica"},{"key":"68_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-87700-4_8","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"F Neumann","year":"2008","unstructured":"Neumann, F., Reichel, J.: Approximating minimum multicuts by evolutionary multi-objective algorithms. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 72\u201381. Springer, Heidelberg (2008)"},{"key":"68_CR16","unstructured":"Balinski, M.: On the maximum matching, minimum covering. In: Proceedings of Symposium on Mathematical Programming, pp. 434\u2013445. Princeton University Press (1970)"},{"key":"68_CR17","unstructured":"Pourhassan, M., Shi, F., Neumann, F.: Parameterized analysis of multi-objective evolutionary algorithms and the weighted vertex cover problem (2016). CoRR http:\/\/arXiv.org\/abs\/1604.01495"},{"issue":"4","key":"68_CR18","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673\u2013697 (2012)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:54Z","timestamp":1498325934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}