An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequalityd
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F06%3A00076021" target="_blank" >RIV/67985840:_____/06:00076021 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequalityd
Original language description
We consider the asymmetric traveling salesperson problem with parametrized triangle inequality. We improve the previous best algorithm of Chandran and Ram.
Czech name
Zlepšený aproximační algoritmus pro asymetrický problém obchodního cestujícího
Czech description
Článek analyzuje zlepšený aproximační algoritmus pro asymetrický problém obchodního cestujícího.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Discrete Algorithms
ISSN
1570-8667
e-ISSN
—
Volume of the periodical
4
Issue of the periodical within the volume
4
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
623-632
UT code for WoS article
—
EID of the result in the Scopus database
—