We prove that the NP-hard problem of finding in an undirected graph G a spanning tree with a maximum number of leaves is MAX-SNP hard. On the basis of a recent result in the theory of approximability of NP-hard optimization problems stating that all problems that are MAX-SNP hard with respect to approximation-preserving reductions do not allow polynomial time approximation schemes, unless P = NP, we conclude that the Maximum Leaves Spanning Tree Problem does not have a polynomial time approximation scheme, unless P = NP, giving therefore a negative answer to this question, which was left open in previous works.

A short note on the approximability of the maximum leaves spanning tree problem

MORZENTI, ANGELO CARLO
1994-01-01

Abstract

We prove that the NP-hard problem of finding in an undirected graph G a spanning tree with a maximum number of leaves is MAX-SNP hard. On the basis of a recent result in the theory of approximability of NP-hard optimization problems stating that all problems that are MAX-SNP hard with respect to approximation-preserving reductions do not allow polynomial time approximation schemes, unless P = NP, we conclude that the Maximum Leaves Spanning Tree Problem does not have a polynomial time approximation scheme, unless P = NP, giving therefore a negative answer to this question, which was left open in previous works.
Analysis of algorithms; Combinatorial problems; Spanning trees
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/666228
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact