A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands-Reference-Cited by-同舟云学术

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

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands

Published:2016-03-29 Issue:4 Volume:77 Page:1216-1239
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Chitnis Rajesh,Esfandiari Hossein,Hajiaghayi MohammadTaghi,Khandekar Rohit,Kortsarz Guy,Seddighin Saeed

Funder

National Science Foundation

Office of Naval Research

Defense Advanced Research Projects Agency

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-016-0145-8.pdf

Reference18 articles.

1. Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of capacitated network design. In: Integer Programming and Combinatoral Optimization-15th International Conference, IPCO 2011, New York, pp. 78–91 (2011)

2. Charikar, M., Chekuri, C., Cheung, T.Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73–91 (1999)

3. Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8), 1346–1367 (2006)

4. Chitnis, R.H., Esfandiari, H., Hajiaghayi, M., Khandekar, R., Kortsarz, G., Seddighin, S.: A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (extended abstract). In: Parameterized and Exact Computation-9th International Symposium, IPEC 2014, Wroclaw, pp. 159–171 (2014)

5. Chitnis, R.H., Hajiaghayi, M., Marx, D.: Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, pp. 1782–1801 (2014)

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

1. Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions);SIAM Journal on Computing;2020-01

2. A Tight Lower Bound for Planar Steiner Orientation;Algorithmica;2019-05-04

3. A Tight Lower Bound for Steiner Orientation;Computer Science – Theory and Applications;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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