An Improved Program for the Full Steiner Tree Problem

DOI10.1145/355759.355764MaRDI QIDQ4156451zbMATH OpenOpenAlexFDO

Authors William M. Boyce

Publication date 1977

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355759.355764

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05)

Cited in

(3)

• A linear time algorithm for full Steiner trees
• Construction of the current Steiner network of the second optimality rank
• Steiner Minimal Trees on Zig-Zag Lines

This page was built for publication: An Improved Program for the Full Steiner Tree Problem

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