Traveling Salesman Problem
The Traveling Salesman Problem (TSP) asks for the shortest possible route that visits a given set of cities exactly once each and returns to the starting city, and it is one of the most famous NP-hard problems in computer science.
6 resources across 2 libraries
Glossary Terms(2)
Traveling Salesman Problem
The Traveling Salesman Problem (TSP) asks for the shortest possible route that visits a given set of cities exactly once each and returns to the starting city,…
Minimum Spanning Tree
A Minimum Spanning Tree (MST) is a subset of edges from a connected, weighted, undirected graph that connects all vertices together, without cycles, at the min…
Interview Questions(4)
What is the Traveling Salesman Problem?
The Traveling Salesman Problem (TSP) asks for the shortest possible route that visits every city exactly once and returns to the start, and it is NP-hard, mean…
What is Bitmask Dynamic Programming?
Bitmask dynamic programming represents a subset of a small collection of items as a single integer, where bit i is 1 if item i is included, letting the DP stat…
What is the Difference Between NP-Hard and NP-Complete?
NP-hard problems are at least as hard as every problem in NP, meaning any NP problem can be reduced to them in polynomial time, but they need not themselves be…
What are Approximation Algorithms and When Do You Use Them?
An approximation algorithm trades exact optimality for polynomial-time runtime by finding a solution provably within a bounded factor of the optimal — such as…