How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
From MaRDI portal
Publication:3613779
DOI10.1007/11786986_38zbMath1223.68128OpenAlexW1511839580MaRDI QIDQ3613779
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_38
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
A metaheuristic approach to the dominating tree problem ⋮ Complexity and Approximation Results for the Connected Vertex Cover Problem ⋮ On approximation of dominating tree in wireless sensor networks ⋮ Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
This page was built for publication: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
