Category:NP-hard problems

N

• NP-complete problems (9 C, 181 P)

O

• Optimal scheduling (23 P)

• NP-hardness

C

• Closest string

G

• Graph bandwidth
• Graph coloring

K

• K-minimum spanning tree

M

• MAX-2-SAT
• MAX-3LIN-EQN
• MAX-3SAT
• MAXEkSAT
• Metric k-center
• Minimum relevant variables in linear system
• Minimum-weight triangulation

Q

• Quadratic assignment problem
• Quadratic bottleneck assignment problem

R

• Radio coloring
• Rectangle packing
• Rectilinear Steiner tree
• Ring star problem

T

• Travelling salesman problem

V

• Vertex k-center problem