Priority algorithms for graph optimization problems.

Allan Borodin Joan Boyar Kim S. Larsen Nazanin Mirmohammadi

Published in: Theor. Comput. Sci. (2010)

Keyphrases

optimization problems
random walk
cost function
graph theory
significant improvement
benchmark datasets
optimization methods
decision trees
computational complexity
worst case
computationally efficient
combinatorial optimization
graph search
graph structure
orders of magnitude
np complete
data structure