Approximation Algorithms for the Maximum Internal Spanning Tree Problem
From MaRDI portal
Publication:3525559
DOI10.1007/978-3-540-74456-6_10zbMath1147.68876MaRDI QIDQ3525559
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_10
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
68W25: Approximation algorithms
Related Items
Spanning trees: A survey, Scatter search for the minimum leaf spanning tree problem, On finding spanning trees with few leaves, Unnamed Item, Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem