|
|||||
|
|
Unconstrained traveling tournament problem is APX-complete |
|
| Affiliation: | 1. Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, N2L 3G1, Ontario, Canada;2. School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, K1S 5B6, Ontario, Canada |
| Abstract: | |
| Keywords: | Traveling tournament problem APX-complete Approximation algorithms Traveling salesman problem |
| 本文献已被 ScienceDirect 等数据库收录！ | |