Bitmask DP

← Back to Dynamic Programming

Dynamic programming where states are represented using bitmasks to track subsets. Enables efficient enumeration of subsets and is used in problems like the Traveling Salesman Problem.

Key Properties

• Subset Enumeration
• TSP Approximation

---

algorithms dynamic-programming bitmask-dp