Approximation Algorithms for the Maximum Internal Spanning Tree Problem

DOI10.1007/978-3-540-74456-6_10zbMath1147.68876OpenAlexW1570066579MaRDI QIDQ3525559

Gábor Salamon

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

zbMATH Keywords

approximation algorithmHamiltonian pathspanning tree leaves

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (5)

On finding spanning trees with few leaves ⋮ Scatter search for the minimum leaf spanning tree problem ⋮ Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem ⋮ Spanning trees: A survey ⋮ Unnamed Item

This page was built for publication: Approximation Algorithms for the Maximum Internal Spanning Tree Problem