scientific article; zbMATH DE number 1424552

MaRDI QIDQ4945801zbMATH OpenFDO

Authors J. Scott Provan

Publication date 6 November 2000

zbMATH Keywords

Euclidean Steiner augmentation problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
• On shortest three-edge-connected Steiner networks with Euclidean distance
• On shortest two-connected Steiner networks with Euclidean distance
• Augmenting Euclidean Networks—the Steiner Case
• Computing Euclidean Steiner trees over segments

Cited in

(1)

• On the structure and complexity of the 2-connected Steiner network problem in the plane

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