{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:10:10Z","timestamp":1750223410770,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Government of Russian Federation","award":["074-U01"],"award-info":[{"award-number":["074-U01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2908812.2908951","type":"proceedings-article","created":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T15:32:51Z","timestamp":1469633571000},"page":"613-620","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search"],"prefix":"10.1145","author":[{"given":"Andrey","family":"Vasin","sequence":"first","affiliation":[{"name":"ITMO University, Saint Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[{"name":"ITMO University, Saint Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527138"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.012"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01020-0_6"},{"key":"e_1_3_2_1_5_1","first-page":"528","volume-title":"Parallel Problem Solving from Nature -- PPSN XIII, number 8672 in Lecture Notes in Computer Science","author":"Buzdalov M.","year":"2014","unstructured":"M. Buzdalov and A. Shalyto . A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting . In Parallel Problem Solving from Nature -- PPSN XIII, number 8672 in Lecture Notes in Computer Science , pages 528 -- 537 . Springer , 2014 . M. Buzdalov and A. Shalyto. A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In Parallel Problem Solving from Nature -- PPSN XIII, number 8672 in Lecture Notes in Computer Science, pages 528--537. Springer, 2014."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240306"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463454"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808675"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.817234"},{"key":"e_1_3_2_1_10_1","unstructured":"R. Lacour K. Klamroth and C. M. Fonseca. A box decomposition algorithm to compute the hypervolume indicator. http:\/\/arxiv.org\/abs\/1510.01963 2015.  R. Lacour K. Klamroth and C. M. Fonseca. A box decomposition algorithm to compute the hypervolume indicator. http:\/\/arxiv.org\/abs\/1510.01963 2015."},{"key":"e_1_3_2_1_11_1","first-page":"435","volume-title":"Nature-Inspired Algorithms for Optimisation, number 193 in Studies in Computational Intelligence","author":"Nebro A. J.","year":"2009","unstructured":"A. J. Nebro and J. J. Durillo . On the effect of applying a steady-state selection scheme in the multi-objective genetic algorithm NSGA-II . In Nature-Inspired Algorithms for Optimisation, number 193 in Studies in Computational Intelligence , pages 435 -- 456 . Springer Berlin Heidelberg , 2009 . A. J. Nebro and J. J. Durillo. On the effect of applying a steady-state selection scheme in the multi-objective genetic algorithm NSGA-II. In Nature-Inspired Algorithms for Optimisation, number 193 in Studies in Computational Intelligence, pages 435--456. Springer Berlin Heidelberg, 2009."},{"key":"e_1_3_2_1_12_1","first-page":"607","volume-title":"Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science","author":"Nekrich Y.","year":"2011","unstructured":"Y. Nekrich . A fast algorithm for three-dimensional layers of maxima problem . In Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science , pages 607 -- 618 . 2011 . Y. Nekrich. A fast algorithm for three-dimensional layers of maxima problem. In Algorithms and Data Structures, number 6844 in Lecture Notes in Computer Science, pages 607--618. 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281525"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683268"},{"key":"e_1_3_2_1_15_1","first-page":"832","volume-title":"Parallel Problem Solving from Nature -- PPSN VIII, number 3242 in Lecture Notes in Computer Science","author":"Zitzler E.","year":"2004","unstructured":"E. Zitzler and S. K\u00fcnzli . Indicator-based selection in multiobjective search . In Parallel Problem Solving from Nature -- PPSN VIII, number 3242 in Lecture Notes in Computer Science , pages 832 -- 842 . 2004 . E. Zitzler and S. K\u00fcnzli. Indicator-based selection in multiobjective search. In Parallel Problem Solving from Nature -- PPSN VIII, number 3242 in Lecture Notes in Computer Science, pages 832--842. 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"GECCO '16: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Denver Colorado USA","acronym":"GECCO '16"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference 2016"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908951","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908812.2908951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:52Z","timestamp":1750222552000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908812.2908951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":17,"alternative-id":["10.1145\/2908812.2908951","10.1145\/2908812"],"URL":"https:\/\/doi.org\/10.1145\/2908812.2908951","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}