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

Target entity: Steiner minimal tree problem
Context triple: [Steiner tree problem, alsoCalled, Steiner minimal tree problem]

• A. Steiner tree problem chosen
  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. Fermat point
  The Fermat point is a special point inside a triangle that minimizes the total distance to the triangle’s three vertices.
• D. Chebyshev center
  The Chebyshev center is a concept in geometry and optimization referring to the center of the smallest-radius ball that encloses a given set.
• E. Prim's minimum spanning tree algorithm
  Prim's minimum spanning tree algorithm is a greedy graph algorithm that incrementally builds a minimum-cost spanning tree by repeatedly adding the cheapest edge connecting the growing tree to a new vertex.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.