Pages that link to "Item:Q4083448"
From MaRDI portal
The following pages link to On Steiner Minimal Trees with Rectilinear Distance (Q4083448):
Displayed 42 items.
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- Comments on Bern's probabilistic results on rectilinear Steiner trees (Q911764) (← links)
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- A fast algorithm for Steiner trees (Q1145507) (← links)
- Routing in VLSI-layout (Q1179413) (← links)
- On Steiner ratio conjectures (Q1179751) (← links)
- A simple proof of Hwang's theorem for rectilinear Steiner minimal trees (Q1179761) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio (Q1186792) (← links)
- On Steiner minimal trees with \(L_ p\) distance (Q1186795) (← 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)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- A simple proof of the planar rectilinear Steiner ratio (Q1200801) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- Planar Manhattan local minimal and critical networks (Q1864609) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- A heuristic for the Steiner problem in graphs (Q1918915) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- The number of tree stars is O*(1.357k) (Q3439499) (← 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)
- The computation of nearly minimal Steiner trees in graphs (Q4750659) (← links)
- Wire segmenting for buffer insertion based on RSTP-MSP (Q5958123) (← links)