Approximating the maximum internal spanning tree problem
type: Item
instance of: scholarly article
title: Approximating the maximum internal spanning tree problem
zbMATH Open document ID: 1194.68177
author: Gábor Salamon
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5626895
zbMATH Keywords: approximation algorithm
zbMATH Keywords: spanning tree leaves
zbMATH Keywords: Hamiltonian path
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.08.029
OpenAlex ID: W1975444413
cites work: Spanning Trees and Optimization Problems
cites work: On finding spanning trees with few leaves
cites work: Q4763416
cites work: Q4763417
cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time
cites work: Q4252040
cites work: Q4737170
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On a class of posets and the corresponding comparability graphs
DOI: 10.1016/J.TCS.2009.08.029
description: scientific article; zbMATH DE number 5626895