To prove problem X is NP-complete, first show

The feasible region of a linear program is

If all edge weights are distinct

0/1 knapsack cannot use the fractional-knapsack greedy rule because

A back edge discovered during DFS implies

Which structure is used by BFS?

Rod cutting is typically solved using

Linear programming optimizes

An MST of a graph with n vertices contains

Shortest paths in a DAG can be computed in