scientific article; zbMATH DE number 1286270

DOI10.1002/(SICI)1097-0037(199903)33:2%3C125::AID-NET4%3E3.0.CO;2-SMaRDI QIDQ4242783zbMATH OpenFDO

Authors Martin Zachariasen

Publication date 4 August 1999

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199903)33:2%3C125::AID-NET4%3E3.0.CO;2-S

zbMATH Keywords

backtrack searchrectilinear Steiner tree problemSteiner minimum tree

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1163724
• scientific article; zbMATH DE number 1424547
• Solving rectilinear Steiner tree problems exactly in theory and practice
• Thirty‐five‐point rectilinear steiner minimal trees in a day

Cites work

• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• On the Average Number of Maxima in a Set of Vectors and Applications
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(9)

• Steiner trees for fixed orientation metrics
• A linear time algorithm for full Steiner trees
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• The number of tree stars is \(O^{*}(1.357^k)\)
• A catalog of Hanan grid problems
• Bounding the expected number of rectilinear full Steiner trees
• scientific article; zbMATH DE number 1163724 (Why is no real title available?)
• Logic Programming

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication:

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