Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Set Covering problem | Statement: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Set Covering problem]

Target entity: Set Covering problem
Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Set Covering problem]

• A. Packing and Covering
  "Packing and Covering" is a classic mathematical monograph by C. A. Rogers that systematically develops the theory of packing and covering problems in geometry and number theory.
• B. Clique problem
  The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
• C. Subset sum problem
  The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
• D. Cover’s theorem
  Cover’s theorem is a result in statistical pattern recognition stating that data cast nonlinearly into a higher-dimensional space is more likely to be linearly separable than in a lower-dimensional space.
• E. Steiner tree problem
  The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Set Covering problem
Target entity description: The Set Covering problem is a classic NP-complete combinatorial optimization problem that asks for the smallest collection of sets whose union covers all elements in a given universe.

• A. Packing and Covering
  "Packing and Covering" is a classic mathematical monograph by C. A. Rogers that systematically develops the theory of packing and covering problems in geometry and number theory.
• B. Clique problem
  The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
• C. Subset sum problem
  The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
• D. Cover’s theorem
  Cover’s theorem is a result in statistical pattern recognition stating that data cast nonlinearly into a higher-dimensional space is more likely to be linearly separable than in a lower-dimensional space.
• E. Steiner tree problem
  The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
• F. None of above. chosen