{"id":"https://openalex.org/W3173417360","doi":"https://doi.org/10.1145/3449639.3459385","title":"Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions","display_name":"Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions","publication_year":2021,"publication_date":"2021-06-21","ids":{"openalex":"https://openalex.org/W3173417360","doi":"https://doi.org/10.1145/3449639.3459385","mag":"3173417360"},"language":"en","primary_location":{"id":"doi:10.1145/3449639.3459385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459385","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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/A5001757263","display_name":"Aneta Neumann","orcid":"https://orcid.org/0000-0002-0036-4782"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Aneta Neumann","raw_affiliation_strings":["The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083504710","display_name":"Jakob Bossek","orcid":"https://orcid.org/0000-0002-4121-4668"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jakob Bossek","raw_affiliation_strings":["University of M\u00fcnster, M\u00fcnster, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["The University of Adelaide, Adelaide, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001757263"],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":11.2941,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.99420626,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.989300012588501,"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.9561741352081299},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7598962783813477},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6843690872192383},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6548873782157898},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5750041007995605},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5044838190078735},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.49043819308280945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46486908197402954},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4477998614311218},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43921899795532227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42475005984306335}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9561741352081299},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7598962783813477},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6843690872192383},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6548873782157898},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5750041007995605},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5044838190078735},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.49043819308280945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46486908197402954},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4477998614311218},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43921899795532227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42475005984306335},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3449639.3459385","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3449639.3459385","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/131351","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/131351","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://dl.acm.org/doi/proceedings/10.1145/3449639","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W627443184","https://openalex.org/W758372786","https://openalex.org/W1680189815","https://openalex.org/W1970879550","https://openalex.org/W2061820396","https://openalex.org/W2080379754","https://openalex.org/W2099746672","https://openalex.org/W2110786553","https://openalex.org/W2141403143","https://openalex.org/W2143996311","https://openalex.org/W2187602868","https://openalex.org/W2531699011","https://openalex.org/W2615497679","https://openalex.org/W2740307401","https://openalex.org/W2809866533","https://openalex.org/W2883624781","https://openalex.org/W2913059114","https://openalex.org/W2945042120","https://openalex.org/W2947037594","https://openalex.org/W2962809967","https://openalex.org/W2962961217","https://openalex.org/W2963640987","https://openalex.org/W2997872002","https://openalex.org/W2998185271","https://openalex.org/W2998370699","https://openalex.org/W3016842374","https://openalex.org/W3091447387","https://openalex.org/W3118655244"],"related_works":["https://openalex.org/W1533846201","https://openalex.org/W4382490453","https://openalex.org/W4296168139","https://openalex.org/W4281935374","https://openalex.org/W4297440966","https://openalex.org/W2952670254","https://openalex.org/W4386157806","https://openalex.org/W3165223799","https://openalex.org/W2959816846","https://openalex.org/W4205436230"],"abstract_inverted_index":{"Submodular":[0],"functions":[1],"allow":[2],"to":[3,42,65],"model":[4],"many":[5],"real-world":[6],"optimisation":[7,23,62],"problems.":[8],"This":[9],"paper":[10],"introduces":[11],"approaches":[12,36],"for":[13,21],"computing":[14],"diverse":[15],"sets":[16],"of":[17,52,69,72,89,94],"high":[18],"quality":[19,51,91],"solutions":[20],"submodular":[22,81],"problems":[24,83],"with":[25,40],"uniform":[26],"and":[27,37,48,84,92],"knapsack":[28],"constraints.":[29],"We":[30,74],"first":[31],"present":[32],"diversifying":[33],"greedy":[34],"sampling":[35],"analyse":[38,85],"them":[39],"respect":[41],"the":[43,49,53,70,95],"diversity":[44,61,68,93],"measured":[45],"by":[46],"entropy":[47],"approximation":[50],"obtained":[54],"solutions.":[55,73],"Afterwards,":[56],"we":[57],"introduce":[58],"an":[59],"evolutionary":[60],"(EDO)":[63],"approach":[64],"further":[66],"improve":[67],"set":[71],"carry":[75],"out":[76],"experimental":[77],"investigations":[78],"on":[79],"popular":[80],"benchmark":[82],"trade-offs":[86],"in":[87],"terms":[88],"solution":[90,97],"resulting":[96],"sets.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}