1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CC2002
Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
A. G. Yaneff
Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
cs.CC2002
How long is a Proof? - A short note
A. G. Yaneff
Withdrawn. Silly notion and out of context.
cs.CG2002★ 1 cited
Remarks on d-Dimensional TSP Optimal Tour Length Behaviour
A. G. Yaneff
The well-known behaviour of the optimal tour length for TSP in d-dimensional Cartesian space causes breaches of the triangle inequality. Other practical inadequacies…