A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs

dc.contributor.authorBonsma, Paul
dc.contributor.authorZickfeld, Florian
dc.date.accessioned2021-12-17T10:08:01Z
dc.date.available2021-12-17T10:08:01Z
dc.date.issued2008
dc.description.abstractWe consider the problem of finding a spanning tree that maximizes the number of leaves (Max Leaf). We provide a 3/2-approximation algorithm for this problem when restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(G), and construct a tree with at least (n-x(G)+4)/3 leaves, and prove that no tree with more than (n-x(G)+2)/2 leaves exists. In contrast to previous approximation algorithms for Max Leaf, our algorithm works with connected dominating sets instead of constructing a tree directly. The algorithm also yields a 4/3-approximation for Minimum Connected Dominating Set in cubic graphs.en
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15645
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14418
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherspanning treeen
dc.subject.othermax leafen
dc.subject.otherapproximationen
dc.subject.othercubic graphen
dc.titleA 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphsen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften::Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2008, 15en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen

Files

Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
Report-015-2008.pdf
Size:
216.61 KB
Format:
Adobe Portable Document Format

Collections