An exact algorithm for the maximum leaf spanning tree problem.
type: Item
instance of: scholarly article
title: An exact algorithm for the maximum leaf spanning tree problem.
zbMATH Open document ID: 1047.90056
DOI: 10.1016/S0305-0548(02)00117-X
author: Tetsuya Fujie
published in: Computers \& Operations Research
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2005381
zbMATH Keywords: Branch and bound
zbMATH Keywords: Spanning trees
zbMATH Keywords: Integer programming
MaRDI profile type: Publication
cites work: Approximation algorithms for connected dominating sets
cites work: Constructing full spanning trees for cubic graphs
cites work: Minimal spanning trees with a constraint on the number of leaves
cites work: Q4198056
cites work: A short note on the approximability of the maximum leaves spanning tree problem
cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time
cites work: Q4252040
cites work: A threshold of ln n for approximating set cover
cites work: The maximum-leaf spanning tree problem: Formulations and facets
cites work: Q4178782
cites work: Spanning Trees with Many Leaves
description: scientific article; zbMATH DE number 2005381