✦ LIBER ✦
A special case of the n-vertex traveling-salesman problem that can be solved in O(n) time
✍ Scribed by James K. Park
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 995 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.