scholarly journals A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

2011 ◽  
Vol 25 (4) ◽  
pp. 1652-1666 ◽  
Author(s):  
Paul Bonsma ◽  
Florian Zickfeld
Keyword(s):  
Approximation Algorithm ◽  
Spanning Trees ◽  
Cubic Graphs

scholarly journals SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES

2013 ◽  
Vol 23 (03) ◽  
pp. 159-170
Author(s):  
OTFRIED CHEONG ◽  
CHANGRYEOL LEE
Keyword(s):  
Approximation Algorithm ◽  
Spanning Trees ◽  
Edge Length ◽  
Minimum Spanning Trees ◽  
Np Hard ◽  
Single Source ◽  
Vertex Set ◽  
Dilation Factor

Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r ∊ S is a designated source. Given a dilation factor δ, we ask for a geometric network G such that for every point v ∊ S there is a path from r to v in G of length at most δ|rv|, and such that the total edge length is minimized. We show that finding such a network of minimum total edge length is NP-hard, and give an approximation algorithm.

scholarly journals On homeomorphically irreducible spanning trees in cubic graphs

2018 ◽  
Vol 89 (2) ◽  
pp. 93-100 ◽  
Author(s):  
Arthur Hoffmann-Ostenhof ◽  
Kenta Noguchi ◽  
Kenta Ozeki
Keyword(s):  
Spanning Trees ◽  
Cubic Graphs
Sign in / Sign up

Export Citation Format

Share Document