Probabilistic solutions to some NP-hard matrix problems.
M. VidyasagarVincent D. BlondelPublished in: Autom. (2001)
Keyphrases
- np hard problems
- np hard
- approximate solutions
- optimal solution
- np hardness
- np complete
- special case
- approximation algorithms
- scheduling problem
- linear programming
- singular value decomposition
- decision problems
- integer programming
- probabilistic model
- generative model
- specific problems
- similar problems
- computationally hard
- practical solutions
- multi objective
- computational issues