{"id":"https://openalex.org/W1977498105","doi":"https://doi.org/10.1109/wiopt.2014.6850325","title":"Distributed online submodular maximization in resource-constrained networks","display_name":"Distributed online submodular maximization in resource-constrained networks","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W1977498105","doi":"https://doi.org/10.1109/wiopt.2014.6850325","mag":"1977498105"},"language":"en","primary_location":{"id":"doi:10.1109/wiopt.2014.6850325","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2014.6850325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 12th 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/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":true,"raw_author_name":"Andrew Clark","raw_affiliation_strings":["Department of Electrical Engineering, University of Washington, Seattle, WA, USA","Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA#TAB#","institution_ids":["https://openalex.org/I201448701"]}]},{"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/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"],"is_corresponding":false,"raw_author_name":"Basel Alomair","raw_affiliation_strings":["Center for Cybersecurity, King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia","[Center for Cybersecurity, King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia]"],"affiliations":[{"raw_affiliation_string":"Center for Cybersecurity, King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia","institution_ids":["https://openalex.org/I1284598098"]},{"raw_affiliation_string":"[Center for Cybersecurity, 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/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":"Linda Bushnell","raw_affiliation_strings":["Department of Electrical Engineering, University of Washington, Seattle, WA, USA","Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA#TAB#","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","Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA#TAB#","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/I201448701"],"apc_list":null,"apc_paid":null,"fwci":1.4623,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8126072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"9","issue":null,"first_page":"397","last_page":"404"},"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.9988999962806702,"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.9988999962806702,"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.9952999949455261,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9869999885559082,"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.9578347206115723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6096977591514587},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5947475433349609},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5932797789573669},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5422130823135376},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4924686849117279},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.42554765939712524},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.4202447533607483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3090917468070984},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.09037372469902039},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.0840916633605957}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9578347206115723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6096977591514587},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5947475433349609},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5932797789573669},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5422130823135376},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4924686849117279},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.42554765939712524},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.4202447533607483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3090917468070984},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.09037372469902039},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0840916633605957},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/wiopt.2014.6850325","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wiopt.2014.6850325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.728.5901","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.728.5901","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.washington.edu/research/nsl/papers/WiOpt-14.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322997","display_name":"King Abdulaziz City for Science and Technology","ror":"https://ror.org/05tdz6m39"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1570963478","https://openalex.org/W1574923065","https://openalex.org/W1576820654","https://openalex.org/W1597597566","https://openalex.org/W1680189815","https://openalex.org/W1815679115","https://openalex.org/W2003207175","https://openalex.org/W2017377951","https://openalex.org/W2053381548","https://openalex.org/W2096220631","https://openalex.org/W2115056380","https://openalex.org/W2121671791","https://openalex.org/W2130488484","https://openalex.org/W2131824593","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2149154668","https://openalex.org/W2158049821","https://openalex.org/W2158291106","https://openalex.org/W2158557760","https://openalex.org/W2159826786","https://openalex.org/W2169607271","https://openalex.org/W2177777145","https://openalex.org/W2621717961","https://openalex.org/W3003506411","https://openalex.org/W4250390143","https://openalex.org/W6635950234","https://openalex.org/W6638511070","https://openalex.org/W6678314445","https://openalex.org/W6679240160","https://openalex.org/W6679608865","https://openalex.org/W6681893214"],"related_works":["https://openalex.org/W2944744777","https://openalex.org/W4321600307","https://openalex.org/W4251076636","https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W3204684126","https://openalex.org/W2735578456","https://openalex.org/W4389478405","https://openalex.org/W2963059222"],"abstract_inverted_index":{"Maximization":[0],"of":[1,57,97,110,125,153],"submodular":[2,25,27,60,72,78,87,101],"set":[3],"functions":[4],"arises":[5],"in":[6,47,158,166],"wireless":[7,49],"applications":[8],"such":[9,40],"as":[10,74,76,119,121],"scheduling,":[11],"caching,":[12],"and":[13,116,144,162],"leader":[14],"selection.":[15],"For":[16,84,99],"a":[17,34,58],"centralized":[18],"entity":[19],"with":[20],"oracle":[21],"access":[22],"to":[23,33,81,129],"the":[24,85,114,122,126,154,159,167],"function,":[26],"maximization":[28,56,79,88],"can":[29],"be":[30,45],"approximated":[31],"up":[32],"constant":[35],"factor":[36],"using":[37,140],"polynomial-time":[38],"algorithms;":[39],"an":[41,93,106,137],"entity,":[42],"however,":[43],"may":[44],"unavailable":[46],"decentralized":[48],"networks.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"consider":[55],"time-varying":[59],"function":[61],"by":[62],"distributed,":[63],"resource-constrained":[64],"nodes.":[65],"We":[66,132],"present":[67],"algorithms":[68],"for":[69],"unconstrained":[70,86,160],"distributed":[71],"maximization,":[73,102],"well":[75,120],"monotone":[77],"subject":[80],"cardinality":[82],"constraints.":[83],"problem,":[89],"our":[90,103,134,147],"algorithm":[91,104],"achieves":[92,105],"expected":[94,107],"optimality":[95,108],"gap":[96,109],"1/3.":[98],"cardinality-constrained":[100],"1/2,":[111],"while":[112],"reducing":[113],"storage":[115],"communication":[117],"overhead,":[118],"computation":[123],"requirements":[124],"nodes,":[127],"compared":[128],"existing":[130],"techniques.":[131],"evaluate":[133],"approach":[135,148],"through":[136],"experimental":[138],"study":[139],"sensor":[141],"scheduling":[142],"data,":[143],"find":[145],"that":[146],"is":[149],"within":[150,163],"ten":[151],"percent":[152,165],"best":[155],"achievable":[156],"utility":[157],"case":[161],"five":[164],"constrained":[168],"case.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}