Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results

DOI10.1109/TIT.2020.3015097zbMATH Open1457.68318OpenAlexW3048223543MaRDI QIDQ5138922FDOQ5138922

Authors: Tung-Wei Kuo 

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2020.3015097

zbMATH Keywords

job schedulingrandomized approximation algorithmtransmission schedulingage of informationdynamic-programming-based exact algorithmMin-WCS problemtime division multiple access channel

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138922)