Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
From MaRDI portal
(Redirected from Publication:1709982)
Recommendations
Cites work
- scientific article; zbMATH DE number 1086912 (Why is no real title available?)
- scientific article; zbMATH DE number 1163724 (Why is no real title available?)
- Balancing minimum spanning trees and shortest-path trees
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Locating the vertices of a steiner tree in an arbitrary metric space
- On Steiner Minimal Trees with Rectilinear Distance
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
- Rectilinear steiner trees: Efficient special-case algorithms
- Shallow-light Steiner arborescences with vertex delays
- Steiner trees with bounded RC-delay
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The rectilinear Steiner tree problem with given topology and length restrictions
- Thirty‐five‐point rectilinear steiner minimal trees in a day
Cited in
(6)- scientific article; zbMATH DE number 5629773 (Why is no real title available?)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- scientific article; zbMATH DE number 8006 (Why is no real title available?)
- Minimum rectilinear Steiner tree of n points in the unit square
- Path Minima in Incremental Unrooted Trees
- The rectilinear Steiner tree problem with given topology and length restrictions
This page was built for publication: Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709982)