Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results (Q5138922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results |
scientific article; zbMATH DE number 7282330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results |
scientific article; zbMATH DE number 7282330 |
Statements
Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results (English)
0 references
4 December 2020
0 references
transmission scheduling
0 references
time division multiple access channel
0 references
age of information
0 references
job scheduling
0 references
Min-WCS problem
0 references
randomized approximation algorithm
0 references
dynamic-programming-based exact algorithm
0 references
