Approximating Spanning Trees with Few Branches
From MaRDI portal
Publication:2848911
DOI10.1007/978-3-642-38016-7_4zbMath1394.68437MaRDI QIDQ2848911
Markus Chimani, Joachim Spoerhase
Publication date: 13 September 2013
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_4
Related Items
Better approximation algorithms for the maximum internal spanning tree problem, An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices