On maximum leaf trees and connections to connected maximum cut problems.
Information Processing Letters(2018)
摘要
•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.•Combined with the previous result, we obtain a logarithmic approximation for the Connected Maximum Cut problem, thus improving upon the Ω(1log2n)-approximation obtained by Hajiaghayi et al. (ESA 2015).
更多查看译文
关键词
Approximation algorithms,Connected maximum cut,Maximum leaf trees
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络