Target-based computer-assisted orchestration: Complexity and approximation algorithms.
Evripidis BampisCarmine-Emanuele CellaBruno EscoffierMila RoccoAlexandre TeillerPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- computer assisted
- approximation algorithms
- worst case
- np hardness
- np hard
- computer aided
- special case
- vertex cover
- open shop
- intraoperative
- minimum cost
- disjoint paths
- primal dual
- computational complexity
- approximation schemes
- constant factor
- web services
- facility location problem
- approximation ratio
- network design problem
- randomized algorithms
- foreign language
- set cover
- error bounds
- approximation guarantees
- precedence constraints
- image processing