On finding a maximum spanning tree of bounded radius

DOI10.1016/S0166-218X(00)00373-5MaRDI QIDQ5954095zbMATH OpenFDO

Authors A. I. Serdjukov

Publication date 6 November 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(00)00373-5

zbMATH Keywords

algorithmcomplexityspanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1285634
• scientific article; zbMATH DE number 4097419
• On the approximability of some maximum spanning tree problems
• On the approximability of some Maximum Spanning Tree Problems
• Approximation algorithms for quickest spanning tree problems

Cited in

(5)

• On the approximability of some Maximum Spanning Tree Problems
• scientific article; zbMATH DE number 4097419 (Why is no real title available?)
• scientific article; zbMATH DE number 1285634 (Why is no real title available?)
• Maximizing spanning trees in almost complete graphs
• On the approximability of some maximum spanning tree problems

This page was built for publication: On finding a maximum spanning tree of bounded radius

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