Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
计算复杂性
2007-05-23 v2
摘要
Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
引用
@article{arxiv.cs/0211032,
title = {Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP},
author = {A. G. Yaneff},
journal= {arXiv preprint arXiv:cs/0211032},
year = {2007}
}
备注
2 pages