Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
Posted: Wed Jul 13, 2022 7:41 pm
a) branch and bound
b) iterative improvement
c) divide and conquer
d) greedy algorithm
b) iterative improvement
c) divide and conquer
d) greedy algorithm