Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.
Mauricio G. C. ResendeThomas A. FeoStuart H. SmithPublished in: ACM Trans. Math. Softw. (1998)
Keyphrases
- benchmark problems
- dynamic programming
- k means
- optimization algorithm
- detection algorithm
- experimental evaluation
- computational cost
- probabilistic model
- learning algorithm
- recognition algorithm
- matching algorithm
- worst case
- computational complexity
- optimal solution
- neural network
- expectation maximization
- segmentation algorithm
- cost function
- np hard
- simulated annealing
- np complete
- tree structure
- search algorithm
- combinatorial optimization
- maximum independent set