scientific article; zbMATH DE number 1286271

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199903)33:2<145::AID-NET5>3.0.CO;2-N" /><145::AID-NET5>3.0.CO;2-N 10.1002/(SICI)1097-0037(199903)33:2<145::AID-NET5>3.0.CO;2-NzbMath0918.90133MaRDI QIDQ4242784

Jia Feng Weng, Doreen Anne Thomas, Marcus Brazil

Publication date: 4 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time algorithmrestricted problemrectilinear Steiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Polynomially solvable special cases of the Steiner problem in planar networks
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
• Steiner Trees for Terminals Constrained to Curves
• The Rectilinear Steiner Tree Problem is $NP$-Complete

This page was built for publication: