Approximating Spanning Trees with Few Branches

DOI10.1007/978-3-642-38016-7_4zbMath1394.68437OpenAlexW1415342194MaRDI 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (2)

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices ⋮ Better approximation algorithms for the maximum internal spanning tree problem

This page was built for publication: Approximating Spanning Trees with Few Branches