Combinatorial Optimization: NP-Completeness and Approximation Algorithms

Casual Mode - Take your time!

1 / 15
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

Which of the following problems is NP-complete?

  1. Traveling Salesman Problem
  2. Linear Programming
  3. Minimum Spanning Tree
  4. Dijkstra's Algorithm
Change Mode