Rectilinear Steiner tree
id:
rectilinear-steiner-tree-300-8740946
title:
Rectilinear Steiner tree
text:
The rectilinear Steiner tree problem, minimum rectilinear Steiner tree problem (MRST), or rectilinear Steiner minimum tree problem (RSMT) is a variant of the geometric Steiner tree problem in the plane, in which the Euclidean distance is replaced with the rectilinear distance. The problem may be formally stated as follows: given n points in the plane, it is required to interconnect them all by a shortest network which consists only of vertical and horizontal line segments. It can be shown that s
brand slug:
wiki
category slug:
encyclopedia
description:
Variant of the Steiner tree problem in geometry and combinatorics
original url:
https://en.wikipedia.org/wiki/Rectilinear_Steiner_tree
date created:
date modified:
2024-03-23T03:56:56Z
main entity:
{"identifier":"Q7303182","url":"https://www.wikidata.org/entity/Q7303182"}
image:
fields total:
13
integrity:
14