Approximation hardness of Travelling Salesman via weighted amplifiers
- Submitting institution
-
University of Portsmouth
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 14386068
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-030-26176-4_10
- Title of conference / published proceedings
- Computing and Combinatorics - 25th International Conference, COCOON 2019, Xian, China, July 29 -31, 2019, Proceedings
- First page
- 115
- Volume
- 11653
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- Yes
- Number of additional authors
-
1
- Research group(s)
-
B - Computational Intelligence
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The Travelling Salesman Problem (TSP) is one of the most famous combinatorial optimisation problems, which is known to be NP-hard. In this paper, the hardness of approximation for TSP is improved from the current best value of 123/122 to 117/116, becoming the new benchmark, as acknowledged by Xu et al., Theoretical Computer Science, 2020, pp. 58-67.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -