Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing.
Mingyang GongRandy GoebelGuohui LinEiji MiyanoPublished in: J. Comb. Optim. (2022)
Keyphrases
- approximation algorithms
- np hard
- worst case
- special case
- vertex cover
- facility location problem
- approximation ratio
- exact algorithms
- network design problem
- minimum cost
- primal dual
- lower bound
- set cover
- scheduling problem
- approximation schemes
- open shop
- upper bound
- constant factor
- randomized algorithms
- dynamic programming
- precedence constraints
- combinatorial auctions
- disjoint paths