A note on the P-time algorithms for solving the maximum independent set problem.
Navid Nasr EsfahaniParisa MazrooeiKaveh MahdavianiBehnaz OmoomiPublished in: DMO (2009)
Keyphrases
- learning algorithm
- significant improvement
- computational complexity
- data sets
- computationally efficient
- theoretical analysis
- orders of magnitude
- machine learning
- graph theory
- combinatorial optimization
- benchmark datasets
- machine learning algorithms
- times faster
- optimization problems
- evolutionary algorithm
- stochastic local search
- discrete optimization