Pages that link to "Item:Q1276966"
From MaRDI portal
The following pages link to Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966):
Displaying 15 items.
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Solving rectilinear Steiner tree problems exactly in theory and practice (Q826086) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- Rectilinear group Steiner trees and applications in VLSI design (Q1411625) (← links)
- A practical algorithm for the minimum rectilinear Steiner tree (Q1966510) (← links)
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
- The number of tree stars is O*(1.357k) (Q3439499) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- An optimal algorithm for rectilinear steiner trees for channels with obstacles (Q3985984) (← links)
- Logic Programming (Q5313200) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets (Q6487979) (← links)
