Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-29116-6_7.pdf
Reference15 articles.
1. Lecture Notes in Computer Science;N. Alon,2007
2. Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Spanning directed trees with many leaves. SIAM J. Discrete Math. 23(1), 466–476 (2009)
3. Lecture Notes in Computer Science;D. Binkele-Raible,2010
4. Bonsma, P.S., Zickfeld, F.: A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs. SIAM J. Disc. Math. 25(4), 1652–1666 (2011)
5. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: Proc. 42nd ACM Symp. Theory Comput. (STOC), pp. 583–592 (2010)
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A $$\nicefrac {4}{3}$$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs;Lecture Notes in Computer Science;2024
2. How heavy independent sets help to find arborescences with many leaves in DAGs;Journal of Computer and System Sciences;2023-08
3. Leafy spanning arborescences in DAGs;Discrete Applied Mathematics;2021-07
4. Leafy Spanning Arborescences in DAGs;LATIN 2020: Theoretical Informatics;2020
5. Acyclic Digraphs;Springer Monographs in Mathematics;2018
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3