{"id":"https://openalex.org/W1552730706","doi":"https://doi.org/10.1109/wiopt.2015.7151103","title":"Scalable and distributed submodular maximization with matroid constraints","display_name":"Scalable and distributed submodular maximization with matroid constraints","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1552730706","doi":"https://doi.org/10.1109/wiopt.2015.7151103","mag":"1552730706"},"language":"en","primary_location":{"id":"doi:10.1109/wiopt.2015.7151103","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2015.7151103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","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/A5004774385","display_name":"Andrew Clark","orcid":"https://orcid.org/0000-0002-5868-6186"},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Clark","raw_affiliation_strings":["Department of Electrical and Computer En-gineering, Worcester Polytechnic Institute, Worcester, WA, USA","Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, WA 01609 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer En-gineering, Worcester Polytechnic Institute, Worcester, WA, USA","institution_ids":["https://openalex.org/I107077323"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, Worcester, WA 01609 USA","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019524943","display_name":"Basel Alomair","orcid":"https://orcid.org/0000-0002-0494-2586"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I1284598098","display_name":"King Abdulaziz City for Science and Technology","ror":"https://ror.org/05tdz6m39","country_code":"SA","type":"facility","lineage":["https://openalex.org/I1284598098"]}],"countries":["SA","US"],"is_corresponding":false,"raw_author_name":"Basel Alomair","raw_affiliation_strings":["Department of Electrical Engineering, University of Washington, Seattle, WA, USA","National Center for Cybersecurity Technology, King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"National Center for Cybersecurity Technology, King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I1284598098"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003489427","display_name":"Linda Bushnell","orcid":"https://orcid.org/0000-0002-8751-2409"},"institutions":[{"id":"https://openalex.org/I1284598098","display_name":"King Abdulaziz City for Science and Technology","ror":"https://ror.org/05tdz6m39","country_code":"SA","type":"facility","lineage":["https://openalex.org/I1284598098"]},{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["SA","US"],"is_corresponding":false,"raw_author_name":"Linda Bushnell","raw_affiliation_strings":["King Abdulaziz City for Science and Technology, National Center for Cybersecurity Technology, Riyadh, Saudi Arabia","Department of Electrical Engineering, University of Washington, Seattle, WA 98195 USA"],"affiliations":[{"raw_affiliation_string":"King Abdulaziz City for Science and Technology, National Center for Cybersecurity Technology, Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I1284598098"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA 98195 USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079723268","display_name":"Radha Poovendran","orcid":"https://orcid.org/0000-0003-0269-8097"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Radha Poovendran","raw_affiliation_strings":["Department of Electrical Engineering, University of Washington, Seattle, WA, USA","Department of Electrical Engineering, University of Washington, Seattle, WA 98195 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA 98195 USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5004774385"],"corresponding_institution_ids":["https://openalex.org/I107077323"],"apc_list":null,"apc_paid":null,"fwci":1.7526,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84562409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"54","issue":null,"first_page":"435","last_page":"442"},"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.9997000098228455,"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.9997000098228455,"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.9979000091552734,"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/T10237","display_name":"Cryptography and Data Security","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9669845700263977},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8892275094985962},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7171387672424316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6402781009674072},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5243359208106995},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.49276402592658997},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44968903064727783},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40374502539634705},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3240816295146942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2823496460914612},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14683914184570312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09965229034423828},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.0549069344997406}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9669845700263977},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8892275094985962},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7171387672424316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6402781009674072},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5243359208106995},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49276402592658997},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44968903064727783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40374502539634705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3240816295146942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2823496460914612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14683914184570312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09965229034423828},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0549069344997406},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wiopt.2015.7151103","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2015.7151103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W612917828","https://openalex.org/W1570963478","https://openalex.org/W1680189815","https://openalex.org/W1977498105","https://openalex.org/W1989453388","https://openalex.org/W2049451257","https://openalex.org/W2061820396","https://openalex.org/W2064933851","https://openalex.org/W2096220631","https://openalex.org/W2115056380","https://openalex.org/W2132651631","https://openalex.org/W2138779671","https://openalex.org/W2168354577","https://openalex.org/W2257832892","https://openalex.org/W2621717961","https://openalex.org/W2757107770","https://openalex.org/W3103014337","https://openalex.org/W6692259890"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4233892543","https://openalex.org/W4320232260","https://openalex.org/W4252399622","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254"],"abstract_inverted_index":{"Submodular":[0],"maximization":[1,64],"enables":[2],"efficient":[3],"approximation":[4],"of":[5,48,57],"machine":[6],"learning,":[7],"networking,":[8],"and":[9,26,83,127,139],"language":[10],"processing":[11],"problems.":[12],"Typically,":[13],"these":[14],"problems":[15],"have":[16,20],"been":[17,44],"shown":[18],"to":[19,73],"matroid":[21,67,106,120],"constraints,":[22,121],"which":[23,122],"generalize":[24],"matching":[25],"partition":[27,119],"conditions.":[28],"Developing":[29],"scalable,":[30],"distributed":[31,60,85,97],"submodular":[32,63,80,102,116],"optimization":[33],"algorithms":[34,61,87,134],"that":[35,132],"guarantee":[36],"the":[37,55,79,90,142,146],"same":[38,143],"performance":[39],"as":[40,145],"centralized":[41,148],"techniques":[42],"has":[43],"an":[45,75,111],"active":[46],"area":[47],"research.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53],"address":[54],"problem":[56],"developing":[58],"scalable":[59],"for":[62,88,99,113],"with":[65,104],"a":[66,96,101,105],"constraint.":[68,107],"Our":[69],"key":[70],"step":[71],"is":[72],"construct":[74],"auxiliary":[76,91],"function":[77,103],"from":[78],"objective":[81],"function,":[82],"develop":[84,110],"exchange-based":[86],"optimizing":[89],"function.":[92],"We":[93,108,130],"first":[94],"introduce":[95],"algorithm":[98,112],"maximizing":[100,114],"then":[109],"time-varying":[115],"functions":[117],"under":[118],"arises":[123],"in":[124],"sensor":[125],"placement":[126],"data":[128],"caching.":[129],"prove":[131],"both":[133],"provide":[135],"(1-1/e)":[136],"optimality":[137],"bounds,":[138],"hence":[140],"achieve":[141],"guarantees":[144],"best":[147],"algorithms.":[149]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}