{"id":"https://openalex.org/W3026348207","doi":"https://doi.org/10.1142/s179383092050069x","title":"Time bounded adaptive information coverage in social networks","display_name":"Time bounded adaptive information coverage in social networks","publication_year":2020,"publication_date":"2020-05-21","ids":{"openalex":"https://openalex.org/W3026348207","doi":"https://doi.org/10.1142/s179383092050069x","mag":"3026348207"},"language":"en","primary_location":{"id":"doi:10.1142/s179383092050069x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092050069x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5101549753","display_name":"Lidan Fan","orcid":null},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lidan Fan","raw_affiliation_strings":["School of Business, The University of Kansas, Lawrence, Kansas 66045, USA"],"raw_orcid":"https://orcid.org/0000-0002-1659-8583","affiliations":[{"raw_affiliation_string":"School of Business, The University of Kansas, Lawrence, Kansas 66045, USA","institution_ids":["https://openalex.org/I146416000"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060149291","display_name":"Linlan Zhang","orcid":"https://orcid.org/0000-0003-2900-0904"},"institutions":[{"id":"https://openalex.org/I75900474","display_name":"Hubei University","ror":"https://ror.org/03a60m280","country_code":"CN","type":"education","lineage":["https://openalex.org/I75900474"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Linlan Zhang","raw_affiliation_strings":["School of Business, Hubei University, Wuhan 430062, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Business, Hubei University, Wuhan 430062, P. R. China","institution_ids":["https://openalex.org/I75900474"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101549753"],"corresponding_institution_ids":["https://openalex.org/I146416000"],"apc_list":null,"apc_paid":null,"fwci":0.1619,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51924428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"05","first_page":"2050069","last_page":"2050069"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9932000041007996,"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.7573502063751221},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7086473107337952},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6722283363342285},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5584681034088135},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.557018518447876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5505450367927551},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.539096474647522},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44293296337127686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4039291441440582},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3223784565925598},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3223172128200531}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7573502063751221},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7086473107337952},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6722283363342285},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5584681034088135},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.557018518447876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5505450367927551},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.539096474647522},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44293296337127686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4039291441440582},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3223784565925598},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3223172128200531},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/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.1142/s179383092050069x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092050069x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1984069252","https://openalex.org/W1986437707","https://openalex.org/W2059816783","https://openalex.org/W2061820396","https://openalex.org/W2108858998","https://openalex.org/W2160411082","https://openalex.org/W2315729860","https://openalex.org/W2792990871","https://openalex.org/W2901425189","https://openalex.org/W2962753204","https://openalex.org/W2962795549","https://openalex.org/W2963309535","https://openalex.org/W2963843653","https://openalex.org/W3122282375","https://openalex.org/W3124352866"],"related_works":["https://openalex.org/W4206383867","https://openalex.org/W2923536170","https://openalex.org/W2402949237","https://openalex.org/W2594118609","https://openalex.org/W2765425000","https://openalex.org/W3204684126","https://openalex.org/W4389478405","https://openalex.org/W2735578456","https://openalex.org/W2944632132","https://openalex.org/W2901206941"],"abstract_inverted_index":{"In":[0,24,140],"this":[1,42],"paper,":[2],"we":[3,50,134,206],"study":[4],"the":[5,19,36,85,101,124,161,172,189,213],"time-bounded":[6],"adaptive":[7,182,185,190],"information":[8,95,105,125,143],"coverage":[9],"problem":[10,153,180],"with":[11,44,193],"myopic":[12,194],"feedback":[13,195],"(TBAIC)":[14],"under":[15],"a":[16,31,39,65,69,74,131,157],"variant":[17],"of":[18,38,87,142,165,201],"independent":[20],"cascade":[21],"(IC)":[22],"model.":[23],"practical":[25],"applications,":[26],"time":[27,66,173],"or":[28],"deadline":[29,46],"is":[30,76,181],"critical":[32],"factor":[33],"to":[34,112,155,159,196,210],"evaluate":[35],"effectiveness":[37],"strategy.":[40],"Along":[41],"line,":[43],"considering":[45],"[Formula:":[47,53,80,202],"see":[48,54,57,81,203],"text],":[49,82],"sequentially":[51],"select":[52],"text]":[55],"([Formula:":[56],"text])":[58],"nodes":[59,147,170],"as":[60,137],"seed":[61,75],"nodes,":[62],"one":[63],"at":[64,78,130],"step,":[67,133],"from":[68],"social":[70],"network,":[71],"and":[72,126,168,184],"after":[73],"selected":[77],"step":[79],"it":[83],"reveals":[84],"set":[86],"its":[88,114],"activated":[89],"neighbors,":[90,115],"which":[91,187],"will":[92,122],"be":[93],"valuable":[94],"for":[96],"selecting":[97],"subsequent":[98],"seeds.":[99],"On":[100],"other":[102],"hand,":[103],"during":[104],"propagation,":[106],"if":[107],"an":[108,198],"active":[109,129,167],"node":[110],"fails":[111],"activate":[113],"though":[116],"not":[117],"become":[118,128],"active,":[119],"those":[120,145],"neighbors":[121],"know":[123],"may":[127],"later":[132],"name":[135],"them":[136],"covered":[138,146,169],"nodes.":[139],"terms":[141],"coverage,":[144],"also":[148],"make":[149],"contributions.":[150],"Therefore,":[151],"our":[152,179],"aims":[154],"choose":[156],"policy":[158,192],"maximize":[160],"expected":[162],"cumulative":[163],"number":[164],"both":[166],"throughout":[171],"within":[174],"deadline.":[175],"We":[176],"prove":[177],"that":[178],"monotone":[183],"submodular,":[186],"guarantees":[188],"greedy":[191,214],"achieve":[197],"approximation":[199],"ratio":[200],"text].":[204],"Additionally,":[205],"propose":[207],"two":[208],"algorithms":[209],"speed":[211],"up":[212],"policy.":[215]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}