%0 Generic
%T Approximation Algorithms for the Traveling Salesman Problem
%A Zhong, Xianghui
%I Universitäts- und Landesbibliothek Bonn
%K Traveling salesman problem
%K Approximation algorithms
%K Traveling Salesman Problem
%K Approximation Algorithms
%K k-Opt Algorithm
%K Lin-Kernighan Algorithm
%K Approximation Ratio
%K Subtour LP
%K Integrality Ratio
%D 2021
%C Universitäts- und Landesbibliothek Bonn
%C Bonn
%U https://katalog.slub-dresden.de/en/?cHash=d436d54d7a76fc6fe03d5b8c85ebf4cf&tx_find_find%5Baction%5D=citation&tx_find_find%5Bcontroller%5D=Search&tx_find_find%5Bid%5D=13-1238729193&tx_find_find%5Btype%5D=endnote
Download citation