{"id":"https://openalex.org/W2025283589","doi":"https://doi.org/10.1145/2739480.2754812","title":"Greedy Hypervolume Subset Selection in the Three-Objective Case","display_name":"Greedy Hypervolume Subset Selection in the Three-Objective Case","publication_year":2015,"publication_date":"2015-07-07","ids":{"openalex":"https://openalex.org/W2025283589","doi":"https://doi.org/10.1145/2739480.2754812","mag":"2025283589"},"language":"en","primary_location":{"id":"doi:10.1145/2739480.2754812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066470602","display_name":"Andreia P. Guerreiro","orcid":"https://orcid.org/0000-0003-0757-2709"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Andreia P. Guerreiro","raw_affiliation_strings":["University of Coimbra, Coimbra, Portugal","university of coimbra, coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"university of coimbra, coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038504776","display_name":"Carlos M. Fonseca","orcid":"https://orcid.org/0000-0001-5162-2457"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Carlos M. Fonseca","raw_affiliation_strings":["University of Coimbra, Coimbra, Portugal","university of coimbra, coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"university of coimbra, coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055996291","display_name":"Lu\u00eds Paquete","orcid":"https://orcid.org/0000-0001-7525-8901"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Lu\u00eds Paquete","raw_affiliation_strings":["University of Coimbra, Coimbra, Portugal","university of coimbra, coimbra, Portugal"],"affiliations":[{"raw_affiliation_string":"University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"university of coimbra, coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066470602"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":null,"apc_paid":null,"fwci":3.1546,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.91956636,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"671","last_page":"678"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8276581764221191},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6419782042503357},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6336681842803955},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5902206897735596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.583509087562561},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.538465142250061},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4867255985736847},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47656846046447754},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.46842658519744873},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.464912474155426},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.45884713530540466},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45425158739089966},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43937593698501587},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4252289831638336},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42373931407928467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33772680163383484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3252260088920593},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10268965363502502}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8276581764221191},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6419782042503357},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6336681842803955},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5902206897735596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.583509087562561},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.538465142250061},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4867255985736847},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47656846046447754},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.46842658519744873},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.464912474155426},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45884713530540466},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45425158739089966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43937593698501587},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4252289831638336},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42373931407928467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33772680163383484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3252260088920593},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10268965363502502},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2739480.2754812","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754812","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G8216206131","display_name":null,"funder_award_id":"SFHR/BD/77725/2011","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W86912879","https://openalex.org/W118842119","https://openalex.org/W166394191","https://openalex.org/W1491287429","https://openalex.org/W1558919105","https://openalex.org/W1680189815","https://openalex.org/W2008049315","https://openalex.org/W2050914643","https://openalex.org/W2100228661","https://openalex.org/W2108968575","https://openalex.org/W2117068724","https://openalex.org/W2127474646","https://openalex.org/W2132936405","https://openalex.org/W2148615815","https://openalex.org/W2154781286","https://openalex.org/W2187701960","https://openalex.org/W2260039808"],"related_works":["https://openalex.org/W4313349761","https://openalex.org/W2963059222","https://openalex.org/W2901206941","https://openalex.org/W2968699064","https://openalex.org/W4300407000","https://openalex.org/W3204684126","https://openalex.org/W2592313125","https://openalex.org/W2944632132","https://openalex.org/W2735578456","https://openalex.org/W4296167846"],"abstract_inverted_index":{"Given":[0],"a":[1,12,28,61,78,104,114,119,123],"non-dominated":[2],"point":[3,15],"set":[4],"X":[5],"\u2282":[6],"Rd":[7],"of":[8,26,30,81,116,138],"size":[9,31],"n":[10,34,96],"and":[11,47],"suitable":[13],"reference":[14],"r":[16],"\u2208":[17],"Rd,":[18],"the":[19,37,68,74,86,100,108,127,139],"Hypervolume":[20],"Subset":[21],"Selection":[22],"Problem":[23],"(HSSP)":[24],"consists":[25],"finding":[27],"subset":[29],"k":[32],">":[33],"that":[35],"maximizes":[36],"hypervolume":[38,101],"indicator.":[39],"It":[40],"arises":[41],"in":[42,132],"connection":[43],"with":[44,60],"multiobjective":[45],"selection":[46],"archiving":[48],"strategies,":[49],"as":[50,52],"well":[51],"Pareto-front":[53],"approximation":[54,155],"post-processing":[55],"for":[56,73,91,126,153],"visualization":[57],"and/or":[58],"interaction":[59],"decision":[62],"maker.":[63],"Efficient":[64],"algorithms":[65],"to":[66,113,143],"solve":[67],"HSSP":[69,109,129],"are":[70],"available":[71,90],"only":[72],"2-dimensional":[75],"case,":[76],"achieving":[77],"time":[79,136],"complexity":[80,137,151],"O(n(k+log":[82],"n)).":[83],"In":[84],"contrast,":[85],"best":[87],"upper":[88],"bound":[89],"d>2":[92],"is":[93,103,130,141],"O(nd/2":[94],"log":[95],"+":[97],"nn-k).":[98],"Since":[99],"indicator":[102],"monotone":[105],"submodular":[106],"function,":[107],"can":[110],"be":[111,144],"approximated":[112],"factor":[115],"(1-1/e)":[117],"using":[118],"greedy":[120,124],"strategy.":[121],"Such":[122],"algorithm":[125,140],"3-dimensional":[128],"proposed":[131],"this":[133,154],"paper.":[134],"The":[135],"shown":[142],"O(n2),":[145],"which":[146],"considerably":[147],"improves":[148],"upon":[149],"recent":[150],"results":[152],"problem.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}