Computer Science · Data Structures

The travelling salesman problem (TSP) can be modeled as finding a Minimum Spanning Tree with degree constraint, or solved using dynamic programming/branch and bound. Among basic graph traversals/techniques, which approach forms the foundation for searching states in TSP?

Verified Solution4 OptionsUpdated: October 2026👁️1 View

1Simple DFS traversal
2A minimum spanning tree
3A simple spanning tree
4Branch and Bound / BFS search✓

Correct answer

Branch and Bound / BFS search

Download Single Question PDF

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Share with Friends & Study Groups

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Preparing for Computer Science?

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Start Free Mock Test →

Chapter Practice

Want more practice questions on Data Structures?

Solve complete topic-wise tests with detailed solutions on GkGet.

Practice Data Structures MCQs →

Recommended practice questions in Computer Science · Data Structures

Browse More Computer Science →

Which Indian independence movement leader was primarily known for his philosophy and practice of non-violent civil disobedience?

Solve Question→

Who gave the call for 'Do or Die' during the Quit India Movement in 1942?

Solve Question→

Which of the following revolutionary pairs were imprisoned together in Cellular Jail and faced harsh conditions, contributing significantly to the Indian independence movement?

The travelling salesman problem (TSP) can be modeled as finding a Minimum Spanning Tree with degree constraint, or solved using dynamic programming/branch and bound. Among basic graph traversals/techniques, which approach forms the foundation for searching states in TSP?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

The travelling salesman problem (TSP) can be modeled as finding a Minimum Spanning Tree with degree constraint, or solved using dynamic programming/branch and bound. Among basic graph traversals/techniques, which approach forms the foundation for searching states in TSP?

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions