On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
From MaRDI portal
DOI10.1007/S004539910005zbMATH Open0951.68101OpenAlexW2066933505MaRDI QIDQ1969944FDOQ1969944
Authors: Michael Kaufmann, Ulrich Fößmeier 
Publication date: 12 December 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004539910005
Recommendations
- Solving rectilinear Steiner tree problems exactly in theory and practice
- Improved Computation of Optimal Rectilinear Steiner Minimal Trees
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- A practical algorithm for the minimum rectilinear Steiner tree
- Thirty‐five‐point rectilinear steiner minimal trees in a day
Cited In (22)
- Solving rectilinear Steiner tree problems exactly in theory and practice
- Title not available (Why is that?)
- The number of tree stars is O*(1.357k)
- Subexponential algorithms for rectilinear Steiner tree and arborescence problems
- Subexponential algorithms for rectilinear Steiner tree and arborescence problems
- Comments on Bern's probabilistic results on rectilinear Steiner trees
- Title not available (Why is that?)
- The rectilinear class Steiner tree problem for intervals on two parallel lines
- The number of tree stars is \(O^{*}(1.357^k)\)
- Subclass of the Steiner problems on a plane with rectilinear metric
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
- Title not available (Why is that?)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- Exact solutions for the Steiner path cover problem on special graph classes
- Two probabilistic results on rectilinear Steiner trees
- Bounding the expected number of rectilinear full Steiner trees
- Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
- Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
- Definition and algorithms for reliable Steiner tree problem
- The Steiner tree problem for terminals on the boundary of a rectilinear polygon
This page was built for publication: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969944)
