On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs-Reference-Cited by-同舟云学术

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

On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs

Published:2005 Issue: Volume: Page:392-406
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Gabow Harold N.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11496915_29.pdf

Reference12 articles.

1. Cheriyan, J., Vempala, S.: Edge covers of setpairs and the iterative rounding method. In: Proc. 8th International Integer Programming and Combinatorial Optimization Conf., pp. 30–44 (2001)

2. Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimumcost k-vertex connected subgraphs. In: Proc. 34th Annual ACM Symp. on Theory of Comput., pp. 306–312 (2002)

3. Frank, A.: Kernel systems of directed graphs. Acta Sci. Math., Szeged, Hungary 41, 63–76 (1979)

4. Frederickson, G.N., Ja’Ja’, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270–283 (1981)

5. Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, submitted; union of An iterative rounding 2-approximation algorithm for the element connectivity problem. In: Proc. 42nd Annual IEEE Symp. on Foundations of Comp. Sci., pp. 339–347 (2001); and A 2-approximation for minimum cost {0, 1, 2} vertex connectivity. In: Proc. 8th International Integer Programming and Combinatorial Optimization Conf., pp. 115–129 (2001)

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

1. Network Design for s - t Effective Resistance;ACM Transactions on Algorithms;2022-07-31

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

3. A spectral approach to network design;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

4. A unified algorithm for degree bounded survivable network design;Mathematical Programming;2015-01-14

5. Approximation Algorithms for Multi-budgeted Network Design Problems;Structural Information and Communication Complexity;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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