An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest-Reference-Cited by-同舟云学术

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

An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest

Published:2018 Issue: Volume: Page:214-223
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Markarian Christine

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-94667-2_18

Reference15 articles.

1. Alon, N., Awerbuch, B., Azar, Y.: The online set cover problem. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 100–105. ACM, New York (2003)

2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., (Seffi) Naor, J.: A general approach to online network optimization problems. ACM Trans. Algorithms 2(4), 640–660 (2006)

3. Lecture Notes in Computer Science;S Angelopoulos,2006

4. Awerbuch, B., Azar, Y., Bartal, Y.: Online generalized Steiner problem. Theor. Comput. Sci. 324(2–3), 313–324 (2004)

5. Berman, P., Coulston, C.: Online algorithms for Steiner tree problems (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, 4–6 May 1997, pp. 344–353 (1997)

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

1. Algorithmic Study of Online Multi-Facility Location Problems;SN Computer Science;2022-05-19

2. Online Algorithms for Prize-Collecting Optimization Problems;Enterprise Information Systems;2022

3. Online Set Cover With Rated Subsets;Proceedings of the 24th International Conference on Enterprise Information Systems;2022

4. Online Non-metric Facility Location with Service-Quality Costs;Proceedings of the 24th International Conference on Enterprise Information Systems;2022

5. Algorithmic View of Online Prize-collecting Optimization Problems;Proceedings of the 23rd International Conference on Enterprise Information Systems;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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