The minimum bounded-diameter spanning forest problem is log-approximable

MaRDI QIDQ3070855zbMATH OpenFDO

Authors Laurent Alfandari

Publication date 28 January 2011

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximating the degree-bounded minimum diameter spanning tree problem
• scientific article; zbMATH DE number 1947056
• Minimum Diameter Spanning Trees and Related Problems
• Approximating the degree-bounded minimum diameter spanning tree problem
• Minimum restricted diameter spanning trees.

This page was built for publication: The minimum bounded-diameter spanning forest problem is log-approximable

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