scientific article; zbMATH DE number 4041289

MaRDI QIDQ3779760zbMATH OpenFDO

Authors Clark D. Thomborson, Linda L. Deneen, Gary M. Shute

Publication date 1987

zbMATH Keywords

minimal Steiner treenonserial dynamic programmingpair of rewritingspush-down automatarectilinear Steiner problem

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the active and full use of memory in right-boundary grammars and push- down automata
• scientific article; zbMATH DE number 742891
• scientific article; zbMATH DE number 1163724
• Solving rectilinear Steiner tree problems exactly in theory and practice
• Improved Computation of Optimal Rectilinear Steiner Minimal Trees

Cited in

(5)

• On the active and full use of memory in right-boundary grammars and push- down automata
• Polynomially solvable special cases of the Steiner problem in planar networks
• The Steiner tree problem in orientation metrics
• Minimum rectilinear Steiner tree of n points in the unit square
• Rectilinear Steiner trees in narrow strips

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 Q3779760)