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: Steiner forest problem | Statement: [Steiner tree problem, hasVariant, Steiner forest problem]

Target entity: Steiner forest problem
Context triple: [Steiner tree problem, hasVariant, Steiner forest problem]

• A. 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.
• B. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• C. Gale’s theorem on flows with convex costs
  Gale’s theorem on flows with convex costs is a fundamental result in mathematical optimization and network flow theory that characterizes optimal flows in networks when the cost functions on edges are convex rather than linear.
• D. Menger theorem in graph theory
  Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
• E. 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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Steiner forest problem
Target entity description: The Steiner forest problem is a combinatorial optimization problem that seeks a minimum-cost forest connecting specified pairs or groups of terminals in a graph, generalizing the classical Steiner tree problem to multiple disjoint terminal sets.

• A. 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.
• B. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• C. Gale’s theorem on flows with convex costs
  Gale’s theorem on flows with convex costs is a fundamental result in mathematical optimization and network flow theory that characterizes optimal flows in networks when the cost functions on edges are convex rather than linear.
• D. Menger theorem in graph theory
  Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
• E. 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.
• F. None of above. chosen