Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Steiner tree problem · Vinony

🌐English

English Deutsch Español Français Nederlands Polski Português Tiếng Việt Русский فارسی 한국어 中文日本語

EntityQ1764144· pop 15· linked from 58 articles

Steiner tree problem

class of problems in combinatorial mathematics

Available in 14 languages

Español
Français
Deutsch
日本語
Русский
Português
Hebrew
Nederlands
Polski
Serbian

Connections

time complexity

Categories

Computational problems in graph theory Geometric algorithms Geometric graphs NP-complete problems Trees (graph theory)

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

NP-hard

Entity

Carl Friedrich Gauss

International Standard Book Number

digital object identifier

International Standard Serial Number

electrical circuit

equilateral triangle

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Steiner's problem

Entitydist 0.26

Ménage problem

Entitydist 0.39

assignment problem

Entitydist 0.42

knapsack problem

Entitydist 0.48

Entitydist 0.53

degree diameter problem

Entitydist 0.55

No-three-in-line problem

Entitydist 0.55

kobon triangle problem

Entitydist 0.57

Entitydist 0.58

Entitydist 0.60

P versus NP problem

Entitydist 0.60

100 prisoners problem

Entitydist 0.62

What links here58 pages

Euclidean minimum spanning tree

planar separator theorem

Physarum polycephalum

Angelika Steger

time complexity

greedy algorithm

curve shortening flow

Karp's 21 NP-complete problems

Ptolemy's theorem

Numbers, season 2

feature-oriented programming

geometric median

Vojtěch Jarník

minimum spanning tree