Approximating the Online Traveling Salesman Problem against Fair Adversaries
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 103 === The traveling salesman problem (TSP) is a well-studied combinatorial optimization problem. The problem requests for visiting cities all completely known and returning to the origin. In this paper, we consider its online version, called the online traveling s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21662245041719086009 |