{"id":"https://openalex.org/W2983019253","doi":"https://doi.org/10.1109/mrs.2019.8901088","title":"An Approximation Algorithm for Distributed Resilient Submodular Maximization: Extended Abstract","display_name":"An Approximation Algorithm for Distributed Resilient Submodular Maximization: Extended Abstract","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2983019253","doi":"https://doi.org/10.1109/mrs.2019.8901088","mag":"2983019253"},"language":"en","primary_location":{"id":"doi:10.1109/mrs.2019.8901088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs.2019.8901088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","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/A5041045546","display_name":"Lifeng Zhou","orcid":"https://orcid.org/0000-0001-7927-8504"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lifeng Zhou","raw_affiliation_strings":["Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103249394","display_name":"Pratap Tokekar","orcid":"https://orcid.org/0000-0002-3728-3636"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pratap Tokekar","raw_affiliation_strings":["Virginia Tech, USA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041045546"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.7759,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75501251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"216","last_page":"218"},"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.9994000196456909,"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.9994000196456909,"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.9968000054359436,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9918000102043152,"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.9456978440284729},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6743026971817017},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6698158979415894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6315692067146301},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6140125393867493},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.6081094145774841},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5236513614654541},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.480229914188385},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47987857460975647},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47840961813926697},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3971810042858124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35303252935409546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33254510164260864},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2899295687675476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2609708309173584},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22315049171447754}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9456978440284729},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6743026971817017},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6698158979415894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6315692067146301},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6140125393867493},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6081094145774841},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5236513614654541},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.480229914188385},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47987857460975647},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47840961813926697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3971810042858124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35303252935409546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33254510164260864},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2899295687675476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2609708309173584},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22315049171447754},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mrs.2019.8901088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mrs.2019.8901088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Symposium on Multi-Robot and Multi-Agent Systems (MRS)","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":14,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W2011193572","https://openalex.org/W2092401564","https://openalex.org/W2136032111","https://openalex.org/W2170735271","https://openalex.org/W2572839999","https://openalex.org/W2735167339","https://openalex.org/W2747182455","https://openalex.org/W2795832897","https://openalex.org/W2901783811","https://openalex.org/W2905647983","https://openalex.org/W2963918661","https://openalex.org/W3105752633","https://openalex.org/W6685093893"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4313343266"],"abstract_inverted_index":{"We":[0,19,40,60,82,109,127],"study":[1,61],"a":[2,8,15,25,84,94,137],"distributed":[3,63,85],"coordination":[4],"problem":[5],"in":[6,117],"which":[7,44],"group":[9],"of":[10,27,54,65,97,105,131,136],"robots":[11,29,45],"collaborates":[12],"to":[13,36],"maximize":[14],"submodular":[16,87,106],"objective":[17,38],"function.":[18,39],"consider":[20],"an":[21,51],"adversarial":[22],"scenario":[23],"where":[24,68],"subset":[26],"the":[28,37,62,66,98,103,112,129],"can":[30,57],"be":[31,47,58],"attacked":[32],"and":[33,120],"cannot":[34],"contribute":[35],"do":[41],"not":[42],"know":[43,50],"will":[46],"attacked,":[48],"but":[49],"upper":[52],"bound":[53],"how":[55],"many":[56],"attacked.":[59],"version":[64],"problem,":[67],"each":[69],"robot":[70],"must":[71],"choose":[72],"its":[73,80,124],"own":[74],"actions":[75],"only":[76],"by":[77],"communicating":[78],"with":[79],"neighbors.":[81],"present":[83],"resilient":[86],"maximization":[88],"algorithm":[89,113,133],"that":[90,111],"guarantees":[91],"performance":[92],"within":[93],"constant":[95],"factor":[96],"optimal.":[99],"Our":[100],"analysis":[101],"uses":[102],"curvature":[104],"set":[107],"functions.":[108],"show":[110],"is":[114,121],"scalable,":[115],"runs":[116],"polynomial":[118],"time,":[119],"faster":[122],"than":[123],"centralized":[125],"version.":[126],"demonstrate":[128],"efficacy":[130],"our":[132],"through":[134],"simulations":[135],"multi-robot":[138],"target":[139],"tracking":[140],"scenario.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}