An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity.
Lu LuMarc E. PosnerPublished in: Math. Oper. Res. (1993)
Keyphrases
- np hard
- worst case
- np hardness
- computational complexity
- decision problems
- special case
- linear programming
- vapnik chervonenkis dimension
- data mining
- polynomial hierarchy
- scheduling problem
- average case complexity
- database
- fixed parameter tractable
- exponential size
- lower complexity
- approximation algorithms
- greedy algorithm
- closely related
- optimal solution
- website
- neural network
- databases