Jump to content

Category:NP-hard problems

From Wikipedia, the free encyclopedia

See also Category:NP-complete problems

Subcategories

This category has only the following subcategory.

O

Optimal scheduling‎ (23 P)

Pages in category "NP-hard problems"

The following 19 pages are in this category, out of 19 total. This list may not reflect recent changes.

NP-hardness

C

Closest string

G

K

K-minimum spanning tree

M

Q

R

T

Travelling salesman problem

V

Vertex k-center problem

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:NP-hard_problems&oldid=548082338"

Computational problems