{"id":"https://openalex.org/W2952216532","doi":"https://doi.org/10.1109/infocom.2019.8737414","title":"Minimum Age TDMA Scheduling","display_name":"Minimum Age TDMA Scheduling","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2952216532","doi":"https://doi.org/10.1109/infocom.2019.8737414","mag":"2952216532"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737414","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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/I87354575","display_name":"National Chengchi University","ror":"https://ror.org/03rqk8h36","country_code":"TW","type":"education","lineage":["https://openalex.org/I87354575"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Tung-Wei Kuo","raw_affiliation_strings":["Department of Computer Science, National Chengchi University, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chengchi University, Taiwan","institution_ids":["https://openalex.org/I87354575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039779896"],"corresponding_institution_ids":["https://openalex.org/I87354575"],"apc_list":null,"apc_paid":null,"fwci":3.5373,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93483366,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2296","last_page":"2304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":1.0,"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/T13553","display_name":"Age of Information Optimization","score":1.0,"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/T10300","display_name":"Congenital Heart Disease Studies","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/2713","display_name":"Epidemiology"},"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/T12079","display_name":"IoT Networks and Protocols","score":0.9564999938011169,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-division-multiple-access","display_name":"Time division multiple access","score":0.8344082832336426},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.638613224029541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6284728646278381},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6223387718200684},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5766274333000183},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5029105544090271},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.46596649289131165},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.443418949842453},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44198957085609436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29361391067504883},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2758791446685791},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1520378589630127}],"concepts":[{"id":"https://openalex.org/C117313154","wikidata":"https://www.wikidata.org/wiki/Q878344","display_name":"Time division multiple access","level":2,"score":0.8344082832336426},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.638613224029541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6284728646278381},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6223387718200684},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5766274333000183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5029105544090271},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.46596649289131165},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.443418949842453},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44198957085609436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29361391067504883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2758791446685791},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1520378589630127},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737414","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737414","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5400000214576721,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1569458199","https://openalex.org/W1677318746","https://openalex.org/W1993918491","https://openalex.org/W2027067237","https://openalex.org/W2058501782","https://openalex.org/W2069417241","https://openalex.org/W2087912304","https://openalex.org/W2144583251","https://openalex.org/W2146487252","https://openalex.org/W2529699293","https://openalex.org/W2588468001","https://openalex.org/W2744483094","https://openalex.org/W2752845512","https://openalex.org/W2791487310","https://openalex.org/W2794289923","https://openalex.org/W2963976574","https://openalex.org/W6637169243","https://openalex.org/W6727840782","https://openalex.org/W6737952328"],"related_works":["https://openalex.org/W2160222453","https://openalex.org/W2121800375","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,42],"consider":[1],"a":[2,14,33,85,125,130],"transmission":[3],"scheduling":[4,88],"problem":[5,30,45,50,70,89,110,144],"in":[6,75],"which":[7],"multiple":[8],"systems":[9],"receive":[10],"update":[11,27],"information":[12],"through":[13],"shared":[15],"Time":[16],"Division":[17],"Multiple":[18],"Access":[19],"(TDMA)":[20],"channel.":[21],"To":[22],"provide":[23],"timely":[24],"delivery":[25],"of":[26,40],"information,":[28],"the":[29,37,46,69,91,108,119,135,142],"asks":[31],"for":[32,98,107,118,134],"schedule":[34],"that":[35,141],"minimizes":[36],"overall":[38],"age":[39],"information.":[41],"call":[43],"this":[44],"Min-Age":[47,120,143],"problem.":[48,121,137],"This":[49],"is":[51,80,145],"first":[52],"studied":[53],"by":[54],"He":[55],"et":[56],"at.":[57],"[IEEE":[58],"Trans.":[59],"Inform.":[60],"Theory,":[61],"2018],":[62],"who":[63],"identified":[64],"several":[65],"special":[66],"cases":[67],"where":[68],"can":[71,111],"be":[72,112],"solved":[73],"optimally":[74],"polynomial":[76],"time.":[77],"Our":[78],"contribution":[79],"threefold.":[81],"First,":[82],"we":[83,95,123,139],"introduce":[84],"new":[86],"job":[87],"called":[90],"Min-WCS":[92,109,136],"problem,":[93],"and":[94,129],"prove":[96,140],"that,":[97],"any":[99],"constant":[100],"r":[101],"\u2265":[102],"1,":[103],"every":[104],"r-approximation":[105,116],"algorithm":[106,117,128,133],"transformed":[113],"into":[114],"an":[115],"Second,":[122],"give":[124],"randomized":[126],"2.733-approximation":[127],"dynamic-programming-based":[131],"exact":[132],"Finally,":[138],"NP-hard.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}