Triple
T5570708
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fermat point |
E146192
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object |
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.
|
E530318
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c008ffed108190a084602227af6157 |
elicitation | completed |
| NER | batch_69c020502a288190af37f9ebb88fccae |
ner | completed |
| NED1 | batch_69c0284bb71881908c0ac4ea2a302327 |
ned_source_triple | completed |
| NED2 | batch_69c04141ea408190aba1463d56ad6b7d |
ned_description | completed |
| NEDg | batch_69c040a395488190bea2fd651c3aeef7 |
nedg | completed |
Created at: March 22, 2026, 3:37 p.m.