{"id":"https://openalex.org/W2038428842","doi":"https://doi.org/10.1145/2487575.2487636","title":"Diversity maximization under matroid constraints","display_name":"Diversity maximization under matroid constraints","publication_year":2013,"publication_date":"2013-08-11","ids":{"openalex":"https://openalex.org/W2038428842","doi":"https://doi.org/10.1145/2487575.2487636","mag":"2038428842"},"language":"en","primary_location":{"id":"doi:10.1145/2487575.2487636","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2487575.2487636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7916/d84q83cq","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009017988","display_name":"Zeinab Abbassi","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zeinab Abbassi","raw_affiliation_strings":["Columbia University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075598023","display_name":"Vahab Mirrokni","orcid":"https://orcid.org/0000-0001-6705-5629"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vahab S. Mirrokni","raw_affiliation_strings":["Google Research, New York, NY, USA","Google Research, New York, NY, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Research, New York, NY, USA#TAB#","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103342513","display_name":"Mayur Thakur","orcid":"https://orcid.org/0000-0002-7817-4073"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mayur Thakur","raw_affiliation_strings":["Google, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"32","last_page":"40"},"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.9965999722480774,"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.9965999722480774,"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.9958000183105469,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9883999824523926,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8937563896179199},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5490267872810364},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5254679918289185},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5199995636940002},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.4993157386779785},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.4682197570800781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4620819091796875},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.44190043210983276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4406653046607971},{"id":"https://openalex.org/keywords/diversification","display_name":"Diversification (marketing strategy)","score":0.42857763171195984},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42189812660217285},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4147951602935791},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.41230762004852295},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4107572138309479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4025863707065582},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.38290101289749146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3403181731700897},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.292485773563385}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8937563896179199},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5490267872810364},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5254679918289185},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5199995636940002},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.4993157386779785},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.4682197570800781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4620819091796875},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44190043210983276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4406653046607971},{"id":"https://openalex.org/C180916674","wikidata":"https://www.wikidata.org/wiki/Q3711935","display_name":"Diversification (marketing strategy)","level":2,"score":0.42857763171195984},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42189812660217285},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4147951602935791},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.41230762004852295},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4107572138309479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4025863707065582},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.38290101289749146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3403181731700897},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.292485773563385},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","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/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2487575.2487636","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2487575.2487636","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},{"id":"pmh:oai:academiccommons.columbia.edu:10.7916/D84Q83CQ","is_oa":false,"landing_page_url":"https://doi.org/10.7916/D84Q83CQ","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Reports"},{"id":"doi:10.7916/d84q83cq","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d84q83cq","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7916/d84q83cq","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d84q83cq","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1484898602","https://openalex.org/W1678075479","https://openalex.org/W1680189815","https://openalex.org/W1967315849","https://openalex.org/W1971002301","https://openalex.org/W1984022436","https://openalex.org/W1990605847","https://openalex.org/W1995913408","https://openalex.org/W1996760769","https://openalex.org/W2003719999","https://openalex.org/W2012833704","https://openalex.org/W2023188792","https://openalex.org/W2028716813","https://openalex.org/W2049670925","https://openalex.org/W2055421030","https://openalex.org/W2062872677","https://openalex.org/W2083305840","https://openalex.org/W2092808090","https://openalex.org/W2100419635","https://openalex.org/W2105997659","https://openalex.org/W2107126505","https://openalex.org/W2119742615","https://openalex.org/W2121759027","https://openalex.org/W2132568467","https://openalex.org/W2135414222","https://openalex.org/W2143996311","https://openalex.org/W2149547418","https://openalex.org/W2152228468","https://openalex.org/W2155912844","https://openalex.org/W2160799467","https://openalex.org/W2161547991","https://openalex.org/W2164976357","https://openalex.org/W2165150232","https://openalex.org/W2340149117","https://openalex.org/W3118655244","https://openalex.org/W3138773240","https://openalex.org/W4236872582","https://openalex.org/W6637422518","https://openalex.org/W6642033509","https://openalex.org/W6642959671","https://openalex.org/W6679881815"],"related_works":["https://openalex.org/W2625145881","https://openalex.org/W2400862597","https://openalex.org/W2159059797","https://openalex.org/W1984819493","https://openalex.org/W2106233458","https://openalex.org/W278334329","https://openalex.org/W4246417054","https://openalex.org/W1975978423","https://openalex.org/W2058489697","https://openalex.org/W2952593185"],"abstract_inverted_index":{"Aggregator":[0],"websites":[1],"typically":[2],"present":[3,93],"documents":[4,30,56],"in":[5,31],"the":[6,41,58,63,69,76,94,113,118,135],"form":[7],"of":[8,28,137,140,147],"representative":[9,29],"clusters.":[10,33],"In":[11],"order":[12],"for":[13,99,117,128],"users":[14],"to":[15,23,36,39,48,52],"get":[16],"a":[17,25,80,103,138],"broader":[18],"perspective,":[19],"it":[20],"is":[21,38,51,111],"important":[22],"deliver":[24],"diversified":[26],"set":[27],"those":[32],"One":[34],"approach":[35,78],"diversification":[37,72],"maximize":[40],"average":[42],"dissimilarity":[43],"among":[44],"documents.":[45],"Another":[46],"way":[47],"capture":[49],"diversity":[50,86,130],"avoid":[53],"showing":[54],"several":[55],"from":[57,62],"same":[59,64],"category":[60],"(e.g.":[61],"news":[65],"channel).":[66],"We":[67,92],"combine":[68],"above":[70],"two":[71],"concepts":[73],"by":[74],"modeling":[75],"latter":[77],"as":[79],"(partition)":[81],"matroid":[82,90,122,132],"constraint,":[83],"and":[84],"study":[85],"maximization":[87],"problems":[88],"under":[89,121,131],"constraints.":[91,123],"first":[95,114],"constant-factor":[96,115],"approximation":[97,116],"algorithm":[98,110],"this":[100],"problem,":[101],"using":[102],"new":[104],"technique.":[105],"Our":[106,124],"local":[107],"search":[108],"0.5-approximation":[109],"also":[112,145],"max-dispersion":[119],"problem":[120],"combinatorial":[125],"proof":[126],"technique":[127],"maximizing":[129],"constraints":[133],"uses":[134],"existence":[136],"family":[139],"Latin":[141],"squares":[142],"which":[143],"may":[144],"be":[146],"independent":[148],"interest.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}