{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:20:31Z","timestamp":1759882831518,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","funder":[{"name":"Ministry of Science and Higher Education of Poland","award":["No number"],"award-info":[{"award-number":["No number"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3726552","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:23:44Z","timestamp":1754925824000},"page":"223-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Lazy Hypervolume Subset Selection Algorithm with Contributions Update"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[{"name":"Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6996-3671","authenticated-orcid":false,"given":"Piotr","family":"Zielniewicz","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"J. Bader K. Deb and E. Zitzler. 2010. Faster Hypervolume-Based Search Using Monte Carlo Sampling. In Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems M. Ehrgott B. Naujoks T. J. Stewart and J. Wallenius (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 313\u2013326.","DOI":"10.1007\/978-3-642-04045-0_27"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"volume-title":"2007 IEEE Congress on Evolutionary Computation. IEEE, 3203\u20133210","author":"Bradstreet L.","key":"e_1_3_2_2_3_1","unstructured":"L. Bradstreet, L. While, and L. Barone. 2007. Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms. In 2007 IEEE Congress on Evolutionary Computation. IEEE, 3203\u20133210."},{"key":"e_1_3_2_2_4_1","volume-title":"Maximum","volume":"15","author":"Bringmann K.","year":"2017","unstructured":"K. Bringmann, S. Cabello, and M. T. M. Emmerich. 2017. Maximum Volume Subset Selection for Anchored Boxes. In 33rd International Symposium on Computational Geometry (SoCG 2017) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 77), B. Aronov and M. J. Katz (Eds.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 22:1\u201322:15."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"K. Bringmann T. Friedrich and P. Klitzke. 2014. Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. In Parallel Problem Solving from Nature - PPSN XIII T. Bartz-Beielstein J. Branke B. Filipi\u010d and J. Smith (Eds.). Springer International Publishing Cham 518\u2013527.","DOI":"10.1007\/978-3-319-10762-2_51"},{"volume-title":"2020 IEEE Congress on Evolutionary Computation (CEC). 1\u20138.","author":"Chen W.","key":"e_1_3_2_2_6_1","unstructured":"W. Chen, H. Ishibuchi, and K. Shang. 2020. Lazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets. In 2020 IEEE Congress on Evolutionary Computation (CEC). 1\u20138."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2729550"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00188"},{"key":"e_1_3_2_2_9_1","unstructured":"A. P. Guerreiro C. M. Fonseca and L. Paquete. 2020. The Hypervolume Indicator: Problems and Algorithms. arXiv:2005.00515 [cs.DS]"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.09.016"},{"volume-title":"PPSN 2022, Dortmund, Germany, September 10\u201314, 2022, Proceedings, Part II","author":"Jaszkiewicz A.","key":"e_1_3_2_2_11_1","unstructured":"A. Jaszkiewicz and P. Zielniewicz. 2022. Greedy Decremental Quick Hypervolume Subset Selection Algorithms. In Parallel Problem Solving from Nature - PPSN XVII: 17th International Conference, PPSN 2022, Dortmund, Germany, September 10\u201314, 2022, Proceedings, Part II (Dortmund, Germany). Springer-Verlag, Berlin, Heidelberg, 164\u2013178."},{"key":"e_1_3_2_2_12_1","volume-title":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"4","author":"Knowles J. D.","unstructured":"J. D. Knowles, D. W. Corne, and M. Fleischer. 2003. Bounded archiving using the Lebesgue measure. In The 2003 Congress on Evolutionary Computation, 2003. CEC '03., Vol. 4. 2490\u20132497 Vol.4."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.06.021"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1039-z"},{"key":"e_1_3_2_2_15_1","volume-title":"Multiobjective Optimisation: A Survey. Comput. Surveys 52, 2, Article 26","author":"Li M.","year":"2019","unstructured":"M. Li and X. Yao. 2019. Quality Evaluation of Solution Sets in Multiobjective Optimisation: A Survey. Comput. Surveys 52, 2, Article 26 (2019), 38 pages."},{"volume-title":"Accelerated greedy algorithms for maximizing submodular set functions","author":"Minoux M.","key":"e_1_3_2_2_16_1","unstructured":"M. Minoux. 1978. Accelerated greedy algorithms for maximizing submodular set functions. In Optimization Techniques, J. Stoer (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 234\u2013243."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCTA.2018.8511628"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3013290"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3726552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:07:34Z","timestamp":1759838854000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3726552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":22,"alternative-id":["10.1145\/3712255.3726552","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3726552","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}