Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes-Reference-Cited by-同舟云学术

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

Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

Published:2021-11 Issue: Volume:42 Page:100659
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Haddadan Arash,Newman Alantha

Funder

National Science Foundation

Office of Naval Research

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference30 articles.

1. Worst-case comparison of valid inequalities for the TSP;Goemans;Math. Program.,1995

2. On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems;Carr;Math. Program.,2004

3. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem;Christofides,1976

4. Heuristic analysis, linear programming and branch and bound;Wolsey,1980

5. A new bound for the 2-edge connected subgraph problem;Carr,1998

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

1. Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem;Operations Research Letters;2022-11

2. A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case;SIAM Journal on Discrete Mathematics;2022-07-28

3. Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours;Mathematical Programming;2022-03-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP