Work

A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem

Year: 2020

Type: preprint

Abstract: In this paper, we consider differential approximability of the traveling salesman problem (TSP). We show that TSP is $3/4$-differential approximable, which improves the currently best known bound $3/4 -O(1/n)$ due to Escoffier and Monnot in 2008, where $n$ denotes the number of vertices in the given graph.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2012.14079

Authors: Amano, Yuki, Makino, Kazuhisa

Institutions: Kyoto University, Research Institute for Mathematical Sciences, Kyoto University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Toyota Motor Corporation, Japan Society for the Promotion of Science

OpenAlex ID: W4287548261

Cites:

Cited by:

Related to: 10