How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
From MaRDI portal
Publication:3613779
DOI10.1007/11786986_38zbMath1223.68128MaRDI 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
90C35: Programming involving graphs or networks
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms