Bitmask DP

DP over subsets encoded as bits — $O(2^n \cdot n)$ states.

Advanced

Travelling salesman for $n \le 20$ , assignment problems.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)