Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14418
For citation please use:
Main Title: A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Author(s): Bonsma, Paul
Zickfeld, Florian
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15645
http://dx.doi.org/10.14279/depositonce-14418
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We 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.
Subject(s): spanning tree
max leaf
approximation
cubic graph
Issue Date: 2008
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2008, 15
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-015-2008.pdf
Format: Adobe PDF | Size: 216.61 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.