Login / Signup
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.
Keizo Miyata
Shigeru Masuyama
Shin-ichi Nakayama
Liang Zhao
Published in:
Discret. Appl. Math. (2006)
Keyphrases
</>
np hardness
np hard
computational complexity
learning algorithm
objective function
simulated annealing
worst case
search space
computationally efficient
path planning
worst case analysis
probabilistic model
particle swarm optimization
expectation maximization
approximation algorithms
spanning tree
optimal solution