tokens: There are many optimization problems that are known to be NP-hard , such as the traveling salesman problem , MAX-SAT , or finding the minimum chromatic number of a graph .
ner_tags: O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B-Data_Structure O