{"id":"https://openalex.org/W2150593780","doi":"https://doi.org/10.1109/infcom.2013.6566998","title":"Maximizing submodular set function with connectivity constraint: Theory and application to networks","display_name":"Maximizing submodular set function with connectivity constraint: Theory and application to networks","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2150593780","doi":"https://doi.org/10.1109/infcom.2013.6566998","mag":"2150593780"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6566998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","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/A5039779896","display_name":"Tung-Wei Kuo","orcid":"https://orcid.org/0000-0002-2518-4462"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]},{"id":"https://openalex.org/I4210086894","display_name":"Research Center for Information Technology Innovation, Academia Sinica","ror":"https://ror.org/000zgvm20","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210086894","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tung-Wei Kuo","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Taiwan","Research Center for Information Technology Innovation, Academia Sinica, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Research Center for Information Technology Innovation, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210086894"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071080660","display_name":"Kate Ching\u2010Ju Lin","orcid":"https://orcid.org/0000-0002-1101-8324"},"institutions":[{"id":"https://openalex.org/I4210086894","display_name":"Research Center for Information Technology Innovation, Academia Sinica","ror":"https://ror.org/000zgvm20","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210086894","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kate Ching-Ju Lin","raw_affiliation_strings":["Research Center for Information Technology Innovation, Academia Sinica, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center for Information Technology Innovation, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210086894"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087200092","display_name":"Ming\u2010Jer Tsai","orcid":"https://orcid.org/0000-0001-6287-908X"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ming-Jer Tsai","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0181,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.923351,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1977","last_page":"1985"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/submodular-set-function","display_name":"Submodular set function","score":0.9136539697647095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7604920864105225},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.6397859454154968},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6070718765258789},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.4754899740219116},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45920661091804504},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45848721265792847},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4399445056915283},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.4191567897796631},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41448774933815},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.37672144174575806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3621962368488312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14101850986480713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11605602502822876}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9136539697647095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7604920864105225},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.6397859454154968},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6070718765258789},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.4754899740219116},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45920661091804504},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45848721265792847},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4399445056915283},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4191567897796631},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41448774933815},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37672144174575806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3621962368488312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14101850986480713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11605602502822876},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2013.6566998","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","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":19,"referenced_works":["https://openalex.org/W1498671329","https://openalex.org/W1511269965","https://openalex.org/W1566959760","https://openalex.org/W1596390374","https://openalex.org/W1680189815","https://openalex.org/W1974908368","https://openalex.org/W1998230089","https://openalex.org/W2025924556","https://openalex.org/W2033885045","https://openalex.org/W2080379754","https://openalex.org/W2095319945","https://openalex.org/W2112243943","https://openalex.org/W2141685007","https://openalex.org/W2148134592","https://openalex.org/W2148349222","https://openalex.org/W2165027678","https://openalex.org/W2166574558","https://openalex.org/W3118655244","https://openalex.org/W6630674846"],"related_works":["https://openalex.org/W4313349761","https://openalex.org/W2382791850","https://openalex.org/W2963719189","https://openalex.org/W2775660632","https://openalex.org/W2999146726","https://openalex.org/W3208987086","https://openalex.org/W2923536170","https://openalex.org/W1773145033","https://openalex.org/W2360385921","https://openalex.org/W2808552933"],"abstract_inverted_index":{"In":[0,121],"this":[1,90,137],"paper,":[2],"we":[3],"investigate":[4],"the":[5,12,34,42,46,52,62,97,105,113,150,171],"wireless":[6,21],"network":[7,29],"deployment":[8,14,91,146,154],"problem,":[9,103,108],"which":[10,74],"seeks":[11],"best":[13],"of":[15,20,36,45,60,69,73,165],"a":[16,58,67,78,84,118,124,175],"given":[17,57],"limited":[18],"number":[19,35],"routers.":[22],"We":[23],"found":[24],"that":[25,81,170],"many":[26],"goals":[27],"for":[28,144,152],"deployment,":[30],"such":[31,80],"as":[32],"maximizing":[33],"covered":[37],"users":[38],"or":[39,41],"areas,":[40],"total":[43],"throughput":[44],"network,":[47],"can":[48],"be":[49],"modelled":[50],"with":[51,77],"submodular":[53,86,100],"set":[54,59,68,87,101],"function.":[55,88],"Specifically,":[56],"routers,":[61],"goal":[63],"is":[64,75,93],"to":[65,116],"find":[66],"locations":[70,128],"S,":[71],"each":[72],"equipped":[76],"router,":[79],"S":[82],"maximizes":[83],"predefined":[85],"However,":[89],"problem":[92],"more":[94],"difficult":[95],"than":[96,178],"traditional":[98],"maximum":[99,106],"function":[102],"e.g.,":[104],"coverage":[107],"because":[109],"it":[110],"requires":[111],"all":[112],"deployed":[114],"routers":[115],"form":[117],"connected":[119],"network.":[120],"addition,":[122],"deploying":[123],"router":[125],"in":[126,167],"different":[127,131],"might":[129],"consume":[130],"costs.":[132],"To":[133],"address":[134],"these":[135],"challenges,":[136],"paper":[138],"introduces":[139],"two":[140],"approximation":[141],"algorithms,":[142],"one":[143],"homogeneous":[145],"cost":[147,155],"scenarios":[148],"and":[149,162],"other":[151,179],"heterogeneous":[153],"scenarios.":[156],"Our":[157],"simulations,":[158],"using":[159],"synthetic":[160],"data":[161],"real":[163],"traces":[164],"census":[166],"Taipei,":[168],"show":[169],"proposed":[172],"algorithms":[173],"achieve":[174],"better":[176],"performance":[177],"heuristics.":[180]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}