Pages that link to "Item:Q5530464"
From MaRDI portal
The following pages link to On Steiner’s Problem with Rectilinear Distance (Q5530464):
Displayed 38 items.
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← 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 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)
- 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)
- Steiner's problem and fagnano's result on the sphere (Q3872168) (← links)
- (Q3907583) (← links)
- Rectilinear Steiner Trees in Rectangle Trees (Q3964590) (← links)
- Locating the vertices of a steiner tree in an arbitrary metric space (Q4077102) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)
- (Q4519132) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)
- Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
- HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES (Q5297794) (← links)
- Wire segmenting for buffer insertion based on RSTP-MSP (Q5958123) (← links)