On places suitable for applying AI principles in NP-hard graph problems' algorithms.
Deniss KumlanderPublished in: Artificial Intelligence and Applications (2007)
Keyphrases
- np hard
- np hard problems
- optimization problems
- computationally hard
- computational complexity
- approximate solutions
- graph theory
- np complete
- graph layout
- polynomial time complexity
- practical problems
- worst case
- learning algorithm
- np hardness
- problems in computer vision
- random walk
- artificial intelligence
- decision problems
- search methods
- constraint satisfaction problems
- benchmark problems
- search problems
- knowledge representation
- edge weights
- bayesian networks
- optimal solution
- computational problems
- machine learning
- set cover
- data structure
- graph search
- exact algorithms
- expert systems
- minimum spanning tree
- special case
- branch and bound algorithm