Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


2-Approximation algorithm for finding a spanning tree with maximum number of leaves

Solis-Oba, Roberto

MPI-I-98-1-010. April 1998, 16 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:

We study the problem of finding a spanning tree with maximum number of leaves.
We present a simple 2-approximation algorithm for the problem, improving on the
previous best performance ratio of 3 achieved by algorithms of Ravi and Lu. Our
algorithm can be implemented to run in linear time using simple data structures.
We also study the variant of the problem in which a given subset of vertices are
required to be leaves in the tree. We provide a 5/2-approximation algorithm for
this version of the problem.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-98-1-010.ps412 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Solis-Oba, Roberto},
  TITLE = {2-Approximation algorithm for finding a spanning tree with maximum number of leaves},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-98-1-010},
  MONTH = {April},
  YEAR = {1998},
  ISSN = {0946-011X},