A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.
Pavel VeselýMarek ChrobakLukasz JezJirí SgallPublished in: SODA (2019)
Keyphrases
- detection algorithm
- computational complexity
- k means
- optimization algorithm
- learning algorithm
- preprocessing
- cost function
- theoretical analysis
- scheduling strategy
- times faster
- dynamic programming
- input data
- matching algorithm
- segmentation algorithm
- high accuracy
- computational cost
- significant improvement
- optimal solution
- simulated annealing
- worst case
- clustering method
- tree structure
- end to end
- job shop scheduling problem
- parallel processors