Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth.
Bin FuYumei HuoHairong ZhaoPublished in: CoRR (2023)
Keyphrases
- approximation schemes
- precedence constraints
- approximation algorithms
- resource constraints
- series parallel
- precedence relations
- scheduling problem
- graph matching
- depth map
- resource allocation
- partial order
- depth information
- special case
- graph theory
- weighted graph
- graph mining
- parallel machines
- graph theoretic
- scheduling algorithm
- single machine scheduling problem
- np hard
- pairwise
- worst case