Submodular Unsplittable Flow on Trees-Reference-Cited by-同舟云学术

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

Submodular Unsplittable Flow on Trees

Published:2016 Issue: Volume: Page:337-349
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Adamaszek Anna,Chalermsook Parinya,Ene Alina,Wiese Andreas

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-33461-5_28

Reference23 articles.

1. Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pp. 400–409. IEEE Computer Society (2013)

2. Anagnostopoulos, A., Grandoni, F., Leonardi, S., Wiese, A.: A mazing 2+ $$\epsilon $$ approximation for unsplittable flow on a path. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 26–41. SIAM (2014)

3. Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A quasi-PTAS for unsplittable flow on line graphs. In: Kleinberg, J.M. (ed.) Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 721–729. ACM (2006)

4. Batra, J., Garg, N., Kumar, A., Mömke, T., Wiese, A.: New approximation schemes for unsplittable flow on a path. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 47–58. SIAM (2015)

5. Bonsma, P.S., Schulz, J., Wiese, A.: A constant-factor approximation algorithm for unsplittable flow on paths. SIAM J. Comput. 43(2), 767–799 (2014)

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

1. A knapsack intersection hierarchy;Operations Research Letters;2023-01

2. Approximations for generalized unsplittable flow on paths with application to power systems optimization;Annals of Operations Research;2022-11-07

3. A PTAS for unsplittable flow on a path;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. Temporal flows in temporal networks;Journal of Computer and System Sciences;2019-08

5. A Mazing 2+ε Approximation for Unsplittable Flow on a Path;ACM Transactions on Algorithms;2018-10-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3