AnO(logn/log logn)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem-Reference-Cited by-同舟云学术

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

AnO(logn/log logn)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Published:2017-08 Issue:4 Volume:65 Page:1043-1061
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Asadpour Arash¹^ORCID,Goemans Michel X.²,Mądry Aleksander³,Gharan Shayan Oveis⁴,Saberi Amin⁵

Affiliation:

1. Department of Information, Operations, and Management Science, New York University Stern School of Business, New York, New York 10012

2. Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

3. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

4. Department of Computer Science and Engineering, University of Washington, Seattle, Washington 98105

5. Department of Management Science and Engineering, Stanford University, Stanford, California 94305

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Link

https://pubsonline.informs.org/doi/pdf/10.1287/opre.2017.1603

Reference48 articles.

1. The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

2. The Traveling Salesman Problem

3. An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods

4. An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

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

1. Constant-Ratio polynomial time approximation of the asymmetric minimum weight cycle cover problem with limited number of cycles;COMMUN COMB OPTIM;2024

2. Energy-aware UAV Parcel Delivery Assignment;2024 7th International Balkan Conference on Communications and Networking (BalkanCom);2024-06-03

3. Matroid-based TSP rounding for half-integral solutions;Mathematical Programming;2024-03-06

4. A Lower Bound for the Max Entropy Algorithm for TSP;Lecture Notes in Computer Science;2024

5. Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems;Doklady Mathematics;2023-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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