Rectilinear steiner trees: Efficient special-case algorithms

DOI10.1002/NET.3230070104zbMATH Open0351.05102OpenAlexW2168570149MaRDI QIDQ4120589FDOQ4120589

Authors: A. V. Aho, M. R. Garey, Frank K. Hwang 

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070104

Mathematics Subject Classification ID

Trees (05C05)

Cited In (18)

• The Steiner tree problem in orientation metrics
• Steiner's problem in double trees
• The point-to-point delivery and connection problems: Complexity and algorithms
• Fast heuristic algorithms for rectilinear Steiner trees
• The rectilinear class Steiner tree problem for intervals on two parallel lines
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
• The computation of nearly minimal Steiner trees in graphs
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• A rectilinear steiner minimal tree algorithm for convex point sets
• Rectilinear Steiner Trees in Rectangle Trees
• A probably fast, provably optimal algorithm for rectilinear Steiner trees
• How to find Steiner minimal trees in Euclidean \(d\)-space
• The role of Steiner hulls in the solution to Steiner tree problems
• Two probabilistic results on rectilinear Steiner trees
• Two new criteria for finding Steiner hulls in Steiner tree problems
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
• Title not available (Why is that?)

This page was built for publication: Rectilinear steiner trees: Efficient special-case algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120589)