On maximum leaf trees and connections to connected maximum cut problems
Information Processing Letters, pp. 31-34, 2018.
Approximation algorithmsConnected maximum cutMaximum leaf trees
•We obtain the first logarithmic approximation algorithm for the Maximum Leaf Tree problem with general weights on directed and undirected graphs.•We show that an α-approximation algorithm for the weighted Maximum Leaf Tree problem leads to an Ω(α)-approximation algorithm for the Connected Maximum Cut problem on general weighted graphs.•C...More
Full Text (Upload PDF)
PPT (Upload PPT)