Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes.
Costin BadicaAlexandru PopaPublished in: Simul. Model. Pract. Theory (2023)
Keyphrases
- approximation algorithms
- worst case
- minimum cost
- constant factor
- np hard
- vertex cover
- special case
- network design problem
- facility location problem
- set cover
- approximation schemes
- approximation guarantees
- optimal solution
- exact algorithms
- open shop
- approximation ratio
- dynamic programming
- lower bound
- strongly np hard
- randomized algorithms
- np hardness
- disjoint paths
- precedence constraints
- primal dual
- error bounds
- finding optimal
- winner determination
- optimal strategy
- greedy algorithm
- linear programming