@article{oai:mie-u.repo.nii.ac.jp:00005071,
 author = {坂上, 知英 and SAKAGAMI, Tomohide and 吉澤, 慎 and YOSHIZAWA, Makoto and 太田, 義勝 and OHTA, Yoshikatsu and 大山口, 通夫 and OYAMAGUCHI, Michio},
 journal = {Research reports of the Faculty of Engineering, Mie University},
 month = {Dec},
 note = {application/pdf, The Traveling Salesman Problem (TSP) is the task of finding a route through a given set of cities with shortest possible length. Many practical applications (VLSI design, etc.) can be modeled as a TSP. But, TSP is NP-hard, so the efficient approximation algorithms have been studied so far. In this paper, we show new approximation algorithms for TSP and the experimental results for these algorithms.},
 pages = {81--96},
 title = {巡回セールスマン問題の近似アルゴリズムについて},
 volume = {25},
 year = {2000}
}