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: Job Sequencing problem (NP-complete variant) | Statement: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Job Sequencing problem (NP-complete variant)]

Target entity: Job Sequencing problem (NP-complete variant)
Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Job Sequencing problem (NP-complete variant)]

• A. Combinatorial Optimization: Algorithms and Complexity
  Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
• B. Scarf algorithm
  The Scarf algorithm is a combinatorial method in mathematical economics and game theory used to compute fixed points and prove the existence of equilibria in markets and games.
• C. P, NP, and NP-Completeness: The Basics of Complexity Theory
  "P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
• D. Job Entry Subsystem 2
  Job Entry Subsystem 2 (JES2) is an IBM mainframe component of the z/OS operating system that manages the input, scheduling, and output of batch jobs and spooled data.
• E. Happy Ending problem
  The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Job Sequencing problem (NP-complete variant)
Target entity description: The Job Sequencing problem (NP-complete variant) is a classic scheduling decision problem, shown NP-complete by Karp, in which one must determine whether there exists an ordering of jobs meeting given constraints such as deadlines or resource limits.

• A. Combinatorial Optimization: Algorithms and Complexity
  Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
• B. Scarf algorithm
  The Scarf algorithm is a combinatorial method in mathematical economics and game theory used to compute fixed points and prove the existence of equilibria in markets and games.
• C. P, NP, and NP-Completeness: The Basics of Complexity Theory
  "P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
• D. Job Entry Subsystem 2
  Job Entry Subsystem 2 (JES2) is an IBM mainframe component of the z/OS operating system that manages the input, scheduling, and output of batch jobs and spooled data.
• E. Happy Ending problem
  The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.
• F. None of above. chosen