A practical algorithm for the minimum rectilinear Steiner tree
From MaRDI portal
Recommendations
- Faster approximation algorithms for the rectilinear Steiner tree problem
- Improved Computation of Optimal Rectilinear Steiner Minimal Trees
- scientific article; zbMATH DE number 426374
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
Cites work
Cited in
(20)- A fast and simple Steiner routing heuristic
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- Faster approximation algorithms for the rectilinear Steiner tree problem
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- 1-line minimum rectilinear Steiner trees and related problems
- Two-level rectilinear Steiner trees
- Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
- scientific article; zbMATH DE number 5629773 (Why is no real title available?)
- scientific article; zbMATH DE number 3972878 (Why is no real title available?)
- Probabilistic partitioning algorithms for the rectilinear steiner problem
- scientific article; zbMATH DE number 1185330 (Why is no real title available?)
- Improved Computation of Optimal Rectilinear Steiner Minimal Trees
- scientific article; zbMATH DE number 1161295 (Why is no real title available?)
- scientific article; zbMATH DE number 1161391 (Why is no real title available?)
- Reductions for the rectilinear steiner tree problem
- scientific article; zbMATH DE number 1424544 (Why is no real title available?)
- Logic Programming
- Wire segmenting for buffer insertion based on RSTP-MSP
This page was built for publication: A practical algorithm for the minimum rectilinear Steiner tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1966510)