Title of article :
On the approximation hardness of dense TSP and other path problems
Author/Authors :
W. Fernandez de la Vega، نويسنده , , M. Karpinski، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1999
Pages :
3
From page :
53
To page :
55
Keywords :
Approximation scheme , Traveling salesman problem , Longest path , Hamiltonian cycle , Approximation hardness , Combinatorial problems , Dense instances , Algorithms
Journal title :
Information Processing Letters
Serial Year :
1999
Journal title :
Information Processing Letters
Record number :
129066
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129066
بازگشت