O(log2k/ log logk)-approximation algorithm for directed Steiner tree-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

O(log2k/ log logk)-approximation algorithm for directed Steiner tree

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Grandoni Fabrizio¹,Laekhanukit Bundit²,Li Shi³

Affiliation:

1. IDSIA, Switzerland

2. Shanghai University of Finance and Economics, China

3. SUNY Buffalo, USA

Funder

NSF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316349

Reference46 articles.

1. Yair Bartal. 1996. Yair Bartal. 1996.

2. MohammadHossein Bateni Moses Charikar and Venkatesan Guruswami. 2009. MohammadHossein Bateni Moses Charikar and Venkatesan Guruswami. 2009.

3. MaxMin allocation via degree lower-bounded arborescences

4. Jaroslaw Byrka Fabrizio Grandoni Thomas Rothvoß and Laura Sanità. 2013. Jaroslaw Byrka Fabrizio Grandoni Thomas Rothvoß and Laura Sanità. 2013.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial Integrality Gap of Flow LP for Directed Steiner Tree;ACM Transactions on Algorithms;2024-07-30

2. On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs;Operations Research Forum;2024-01-17

3. Navigational guidance – A deep learning approach;European Journal of Operational Research;2023-11

4. Online Generalized Network Design Under (Dis)Economies of Scale;Mathematics of Operations Research;2023-01-12

5. A Spectral Approach to Network Design;SIAM Journal on Computing;2022-07-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP