关于度量旅行商问题的3/2逼近算法的历史注释

IF 0.5 3区哲学 Q3 HISTORY & PHILOSOPHY OF SCIENCE

Historia Mathematica Pub Date : 2020-11-01 DOI:10.1016/j.hm.2020.04.003

René van Bevern , Viktoriia A. Slugina

{"title":"关于度量旅行商问题的3/2逼近算法的历史注释","authors":"René van Bevern , Viktoriia A. Slugina","doi":"10.1016/j.hm.2020.04.003","DOIUrl":null,"url":null,"abstract":"<div><p>One of the most fundamental results in combinatorial optimization is the polynomial-time 3/2-approximation algorithm for the metric traveling salesman problem. It was presented by Christofides in 1976 and is well known as “the Christofides algorithm”. Recently, some authors started calling it “Christofides-Serdyukov algorithm”, pointing out that it was published independently in the USSR in 1978. We provide some historic background on Serdyukov's findings and a translation of his article from Russian into English.</p></div>","PeriodicalId":51061,"journal":{"name":"Historia Mathematica","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.hm.2020.04.003","citationCount":"30","resultStr":"{\"title\":\"A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem\",\"authors\":\"René van Bevern , Viktoriia A. Slugina\",\"doi\":\"10.1016/j.hm.2020.04.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>One of the most fundamental results in combinatorial optimization is the polynomial-time 3/2-approximation algorithm for the metric traveling salesman problem. It was presented by Christofides in 1976 and is well known as “the Christofides algorithm”. Recently, some authors started calling it “Christofides-Serdyukov algorithm”, pointing out that it was published independently in the USSR in 1978. We provide some historic background on Serdyukov's findings and a translation of his article from Russian into English.</p></div>\",\"PeriodicalId\":51061,\"journal\":{\"name\":\"Historia Mathematica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2020-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.hm.2020.04.003\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Historia Mathematica\",\"FirstCategoryId\":\"98\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0315086020300240\",\"RegionNum\":3,\"RegionCategory\":\"哲学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"HISTORY & PHILOSOPHY OF SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Historia Mathematica","FirstCategoryId":"98","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0315086020300240","RegionNum":3,"RegionCategory":"哲学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"HISTORY & PHILOSOPHY OF SCIENCE","Score":null,"Total":0}

引用次数: 30

摘要

组合优化中最基本的结果之一是度量旅行商问题的多项式时间3/2逼近算法。它是由Christofides于1976年提出的，被称为“Christofides算法”。最近，一些作者开始称其为“Christofides-Serdyukov算法”，指出它是1978年在苏联独立发表的。我们提供了谢尔久科夫发现的一些历史背景，并将他的文章从俄语翻译成英语。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

One of the most fundamental results in combinatorial optimization is the polynomial-time 3/2-approximation algorithm for the metric traveling salesman problem. It was presented by Christofides in 1976 and is well known as “the Christofides algorithm”. Recently, some authors started calling it “Christofides-Serdyukov algorithm”, pointing out that it was published independently in the USSR in 1978. We provide some historic background on Serdyukov's findings and a translation of his article from Russian into English.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Historia Mathematica 数学-科学史与科学哲学

CiteScore

1.10

自引率

0.00%

发文量

审稿时长

72 days

期刊介绍： Historia Mathematica publishes historical scholarship on mathematics and its development in all cultures and time periods. In particular, the journal encourages informed studies on mathematicians and their work in historical context, on the histories of institutions and organizations supportive of the mathematical endeavor, on historiographical topics in the history of mathematics, and on the interrelations between mathematical ideas, science, and the broader culture.