Q. Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently? (Solved)
1. branch and bound
2. iterative improvement
3. divide and conquer
4. greedy algorithm
- a. branch and bound
1. branch and bound
2. iterative improvement
3. divide and conquer
4. greedy algorithm