Approximation Algorithms for Generalized Path Scheduling.
Haozhou PangMohammad R. SalavatipourPublished in: ISAAC (2020)
Keyphrases
- approximation algorithms
- minimum cost
- precedence constraints
- np hard
- worst case
- special case
- scheduling problem
- vertex cover
- disjoint paths
- primal dual
- scheduling algorithm
- open shop
- network design problem
- facility location problem
- constant factor
- approximation ratio
- shortest path
- randomized algorithms
- undirected graph
- approximation schemes
- set cover
- np hardness
- resource allocation
- network flow
- parallel processors
- setup times
- resource constraints
- approximation guarantees
- job shop