{"id":"https://openalex.org/W7084076106","doi":"https://doi.org/10.1109/infocom55648.2025.11044677","title":"Fast Computation of Partial Index and Application to an AoI Minimization Problem","display_name":"Fast Computation of Partial Index and Application to an AoI Minimization Problem","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W7084076106","doi":"https://doi.org/10.1109/infocom55648.2025.11044677"},"language":"en","primary_location":{"id":"doi:10.1109/infocom55648.2025.11044677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Haoqian Xue","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Haoqian Xue","raw_affiliation_strings":["The Chinese University of Hong Kong,Department of Information Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Department of Information Engineering","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xiaojun Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaojun Lin","raw_affiliation_strings":["The Chinese University of Hong Kong,Department of Information Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Department of Information Engineering","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10091","display_name":"Malaria Research and Control","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T10091","display_name":"Malaria Research and Control","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10695","display_name":"Parasites and Host Interactions","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2405","display_name":"Parasitology"},"field":{"id":"https://openalex.org/fields/24","display_name":"Immunology and Microbiology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12402","display_name":"Travel-related health issues","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6295999884605408},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5950999855995178},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4941999912261963},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44850000739097595},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.43849998712539673},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4043000042438507}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6295999884605408},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.613099992275238},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5950999855995178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5748999714851379},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4250999987125397},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4043000042438507},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36890000104904175},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C53846429","wikidata":"https://www.wikidata.org/wiki/Q186475","display_name":"Partial derivative","level":2,"score":0.3294999897480011}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom55648.2025.11044677","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,50,77],"paper,":[2],"we":[3,86,101],"study":[4],"efficient":[5],"algorithms":[6,69],"for":[7,59,70,94,137],"computing":[8,55,182],"the":[9,21,32,42,56,81,95,109,118,122,134,155,165,183],"partial":[10,43,57,110,135,184],"index.":[11],"We":[12,114],"focus":[13],"on":[14,99,190],"an":[15],"AoI":[16,119],"(Age-of-Information)":[17],"minimization":[18],"problem":[19,120],"under":[20,121],"generate-at-will":[22,123],"setting":[23,78,124],"such":[24],"that":[25,106,117,174],"multiple":[26,35,82],"sources/agents":[27],"transmit":[28],"information":[29],"updates":[30],"to":[31,48,76,80],"base-station":[33],"over":[34],"heterogeneous":[36,83],"and":[37,129,140,160],"unreliable":[38],"wireless":[39],"channels.":[40,84],"While":[41],"index":[44,58,72,111,136,185],"has":[45],"been":[46],"proposed":[47,176],"solve":[49],"otherwise":[51],"exponential-complexity":[52],"MDP":[53],"problem,":[54],"each":[60],"source":[61],"still":[62],"incurs":[63],"significant":[64],"complexity.":[65],"Existing":[66],"fast":[67,104],"computation":[68],"Whittle":[71],"cannot":[73],"be":[74],"applied":[75],"due":[79],"Instead,":[85],"identify":[87],"a":[88,103,144],"number":[89,156,166],"of":[90,146,157,167],"general":[91,127],"structural":[92],"conditions":[93,128],"per-agent":[96],"MDP,":[97],"based":[98,189],"which":[100],"develop":[102],"algorithm":[105,131,177],"can":[107,132],"compute":[108,133],"more":[112],"efficiently.":[113],"then":[115],"verify":[116],"satisfies":[125],"these":[126],"our":[130,175],"all":[138,141],"states":[139,159],"channels":[142],"with":[143],"complexity":[145],"<tex":[147,151,161],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[148,152,162],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathcal{O}(M^{3}K^{3})$</tex>,":[149],"where":[150],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$K$</tex>":[153],"denotes":[154,164],"per-source":[158],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M$</tex>":[163],"channel":[168],"types.":[169],"Our":[170],"numerical":[171],"results":[172],"confirm":[173],"is":[178],"significantly":[179],"faster":[180],"in":[181],"than":[186],"standard":[187],"methods":[188],"binary":[191],"search.":[192]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}