A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem

@article{Galbiati1994ASN,
  title={A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem},
  author={Giulia Galbiati and Francesco Maffioli and Angelo Morzenti},
  journal={Inf. Process. Lett.},
  year={1994},
  volume={52},
  pages={45-49}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…