a public good project by the
Synthesis
Company
of California

© 2026

A faster approximation algorithm for the Steiner problem in graphs | doi.page

0 citations0 references

Google Scholar doi.org

A faster approximation algorithm for the Steiner problem in graphs

Acta Informatica·1986·Vol. 23(2), pp. 223–229

Citations Over TimeTop 10% of 1986 papers

Y. F. Wu, Peter Widmayer, Chris K.C. Wong

Related Papers

→ On the Full and Bottleneck Full Steiner Tree Problems(2003)27 cited
→ Tree Spanners for Subgraphs and Related Tree Covering Problems(2000)3 cited
Approximating Full Steiner Tree in a Unit Disk Graph.(2014)
It is hard to agree on a spanning tree(2014)