Rectilinear Steiner tree

The rectilinear Steiner tree problem, minimum rectilinear Steiner tree problem (MRST), or rectilinear Steiner minimum tree problem (RSMT) is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
In today's VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
2008
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2007
2007
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
2005
2005
Given n points on a plane, a rectilinear Steiner minimal tree (RSMT) connects these points through some extra points called… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
1999
1999
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First, a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
1997
1997
The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. To… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First a… (More)
  • figure 4
  • figure 6
  • figure 22
Is this relevant?
1993
1993
Given a set of terminals in the plane, a rectilin-ear Steiner minimal tree is a shortest interconnection among these terminals… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?