Pages that link to "Item:Q5530464"
From MaRDI portal
The following pages link to On Steiner’s Problem with Rectilinear Distance (Q5530464):
Displayed 50 items.
- Steiner trees with bounded RC-delay (Q527413) (← links)
- Planar bus graphs (Q724233) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- Steiner trees for fixed orientation metrics (Q1029671) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Some upper bounds for minimal trees (Q1178229) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Minimal surfaces, crystals, shortest networks, and undergraduate research (Q1200117) (← links)
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria (Q1236403) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- The rectilinear class Steiner tree problem for intervals on two parallel lines (Q1327560) (← links)
- Optimal and approximate bottleneck Steiner trees (Q1362990) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- A deep-submicron Steiner tree. (Q1597158) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (Q1853036) (← links)
- Steiner's problem in double trees (Q1861809) (← links)
- Planar Manhattan local minimal and critical networks (Q1864609) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- A practical algorithm for the minimum rectilinear Steiner tree (Q1966510) (← links)
- PORA: a Physarum-inspired obstacle-avoiding routing algorithm for integrated circuit design (Q1988865) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- Two-level rectilinear Steiner trees (Q2362106) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Rectilinear paths with minimum segment lengths (Q2446305) (← links)
- Steiner minimal trees in rectilinear and octilinear planes (Q2463797) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions (Q3196405) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- Steiner Trees with Bounded RC-Delay (Q3453297) (← links)
- Steiner's problem and fagnano's result on the sphere (Q3872168) (← links)