A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
Mark JerrumAlistair SinclairEric VigodaPublished in: J. ACM (2004)
Keyphrases
- polynomial time approximation
- dynamic programming
- learning algorithm
- worst case
- np hard
- linear programming
- search space
- k means
- computational complexity
- bin packing
- detection algorithm
- error bounds
- simulated annealing
- theoretical analysis
- nonnegative matrix factorization
- vertex cover
- spectral clustering
- expectation maximization
- evolutionary algorithm
- search algorithm
- optimal solution
- objective function