k-Edge-Connectivity: Approximation and LP Relaxation-Reference-Cited by-同舟云学术

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

k-Edge-Connectivity: Approximation and LP Relaxation

Published:2011 Issue: Volume: Page:225-236
ISSN:0302-9743
Container-title:Approximation and Online Algorithms
language:
Short-container-title:

Author:

Pritchard David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18318-8_20

Reference32 articles.

1. http://arxiv.org/abs/1004.1917

2. Asadpour, A., Goemans, M., Madry, A., Gharan, S.O., Saberi, A.: An O(logn/loglogn)-approximation algorithm for the asymmetric traveling salesman problem. In: Proc. 21st SODA (2010)

3. Bang-Jensen, J.: Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. Discrete Mathematics 309(18), 5655–5667 (2009)

4. Bang-Jensen, J., Thomassé, S.: Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discrete Appl. Math. 131, 555–559 (2003)

5. Bang-Jensen, J., Yeo, A.: Decomposing k-arc-strong tournaments into strong spanning subdigraphs. Combinatorica 24(3), 331–349 (2004)

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

1. Ghost Value Augmentation for k-Edge-Connectivity;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Thin Trees for Laminar Families;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs;Lecture Notes in Computer Science;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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