A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width.
Eric AngelSébastien MoraisDamien RegnaultPublished in: Euro-Par (2022)
Keyphrases
- bounded tree width
- bicriteria
- tree width
- np complete
- markov networks
- efficient solutions
- first order logic
- constraint networks
- knapsack problem
- scheduling problem
- integer linear programming
- constraint programming
- constraint satisfaction
- maximum likelihood
- global constraints
- directed graph
- structural properties
- flowshop
- approximation algorithms
- mixed integer
- precedence constraints
- special case