{"id":"https://openalex.org/W4385767993","doi":"https://doi.org/10.24963/ijcai.2023/617","title":"Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint","display_name":"Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint","publication_year":2023,"publication_date":"2023-08-01","ids":{"openalex":"https://openalex.org/W4385767993","doi":"https://doi.org/10.24963/ijcai.2023/617"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2023/617","is_oa":true,"landing_page_url":"http://dx.doi.org/10.24963/ijcai.2023/617","pdf_url":"https://www.ijcai.org/proceedings/2023/0617.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2023/0617.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043146473","display_name":"Anh Viet","orcid":"https://orcid.org/0000-0003-3850-1671"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The 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":"Anh Viet Do","raw_affiliation_strings":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019911052","display_name":"Mingyu Guo","orcid":"https://orcid.org/0000-0002-3478-9201"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The 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":"Mingyu Guo","raw_affiliation_strings":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","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":"The 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":"Aneta Neumann","raw_affiliation_strings":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"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":"The 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":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5558","last_page":"5566"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9955999851226807,"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/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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.9820687770843506},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.875694215297699},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6994308829307556},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6355065703392029},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5742660760879517},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5232621431350708},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5127521753311157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5047010183334351},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44337376952171326},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42335373163223267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40052953362464905},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2595914900302887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14305740594863892}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9820687770843506},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.875694215297699},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6994308829307556},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6355065703392029},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5742660760879517},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5232621431350708},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5127521753311157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5047010183334351},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44337376952171326},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42335373163223267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40052953362464905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2595914900302887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14305740594863892},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2023/617","is_oa":true,"landing_page_url":"http://dx.doi.org/10.24963/ijcai.2023/617","pdf_url":"https://www.ijcai.org/proceedings/2023/0617.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2023/617","is_oa":true,"landing_page_url":"http://dx.doi.org/10.24963/ijcai.2023/617","pdf_url":"https://www.ijcai.org/proceedings/2023/0617.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4699999988079071,"display_name":"Partnerships for the goals"}],"awards":[{"id":"https://openalex.org/G1057128212","display_name":"Evolutionary diversity optimisation","funder_award_id":"DP190103894","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G3128856113","display_name":"Bio-inspired Computing for Problems with Chance Constraints","funder_award_id":"FT200100536","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G8158565945","display_name":null,"funder_award_id":"DP190103894 and FT200100536","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385767993.pdf"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W27109896","https://openalex.org/W192097321","https://openalex.org/W1482405521","https://openalex.org/W1680189815","https://openalex.org/W1884989346","https://openalex.org/W1885159080","https://openalex.org/W1962684803","https://openalex.org/W1965734368","https://openalex.org/W1975512711","https://openalex.org/W1981351071","https://openalex.org/W1986998000","https://openalex.org/W2011193572","https://openalex.org/W2064933851","https://openalex.org/W2068073180","https://openalex.org/W2085826829","https://openalex.org/W2089729462","https://openalex.org/W2098382610","https://openalex.org/W2129256050","https://openalex.org/W2132651631","https://openalex.org/W2133057300","https://openalex.org/W2144933361","https://openalex.org/W2151239055","https://openalex.org/W2170735271","https://openalex.org/W2231297807","https://openalex.org/W2283465032","https://openalex.org/W2294347342","https://openalex.org/W2500139799","https://openalex.org/W2522444422","https://openalex.org/W2757107770","https://openalex.org/W2998121386","https://openalex.org/W3042439099","https://openalex.org/W3083404835","https://openalex.org/W3084163365","https://openalex.org/W3090042385","https://openalex.org/W3116915069","https://openalex.org/W3137955168","https://openalex.org/W3142806383","https://openalex.org/W3173417360","https://openalex.org/W3189020374","https://openalex.org/W3214981176","https://openalex.org/W4232212779","https://openalex.org/W4234897719","https://openalex.org/W4283809024","https://openalex.org/W4312724701","https://openalex.org/W4382240087"],"related_works":["https://openalex.org/W4320232260","https://openalex.org/W4252399622","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2923536170","https://openalex.org/W2896347948","https://openalex.org/W2352672974","https://openalex.org/W2402949237","https://openalex.org/W4302557420","https://openalex.org/W2950500962"],"abstract_inverted_index":{"Finding":[0],"diverse":[1,32],"solutions":[2,33],"to":[3,58],"optimization":[4,23],"problems":[5],"has":[6,24,35],"been":[7,25],"of":[8,46,94,112],"practical":[9],"interest":[10],"for":[11],"several":[12],"decades,":[13],"and":[14,49,77,90],"recently":[15],"enjoyed":[16],"increasing":[17],"attention":[18],"in":[19,28,86,110],"research.":[20],"While":[21],"submodular":[22,47,64],"rigorously":[26],"studied":[27],"many":[29],"fields,":[30],"its":[31],"extension":[34],"not.":[36],"In":[37],"this":[38],"study,":[39],"we":[40],"consider":[41],"the":[42,73],"most":[43],"basic":[44],"variants":[45],"optimization,":[48],"propose":[50],"two":[51],"simple":[52],"greedy":[53],"algorithms,":[54],"which":[55],"are":[56,67],"known":[57],"be":[59],"effective":[60],"at":[61],"maximizing":[62],"monotone":[63],"functions.":[65],"These":[66],"equipped":[68],"with":[69,101],"parameters":[70],"that":[71],"control":[72],"trade-off":[74],"between":[75],"objective":[76,88],"diversity.":[78],"Our":[79,98],"theoretical":[80],"contribution":[81],"shows":[82],"their":[83,95,107],"approximation":[84],"guarantees":[85],"both":[87],"value":[89],"diversity,":[91],"as":[92],"functions":[93],"respective":[96],"parameters.":[97],"experimental":[99],"investigation":[100],"maximum":[102],"vertex":[103],"coverage":[104],"instances":[105],"demonstrates":[106],"empirical":[108],"differences":[109],"terms":[111],"objective-diversity":[113],"trade-offs.":[114]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}