A short note on the approximability of the maximum leaves spanning tree problem
type: Item
instance of: scholarly article
title: A short note on the approximability of the maximum leaves spanning tree problem
zbMATH Open document ID: 0942.68647
DOI: 10.1016/0020-0190(94)90139-2
published in: Information Processing Letters
publication date: 1996-02-26T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 681770
Wikidata QID: Q29011645
author: Giulia Galbiati
author: Francesco Maffioli
author: Angelo Morzenti
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90139-2
OpenAlex ID: W2035040468
cites work: Q4230322
cites work: Q4230321
cites work: Completeness in approximation classes
cites work: Self-stabilizing systems in spite of distributed control
cites work: Q4198056
cites work: Approximation algorithms for combinatorial problems
cites work: Optimization, approximation, and complexity classes
cites work: Q3928248
description: scientific article; zbMATH DE number 681770