Scalefree hardness of average-case Euclidean TSP approximation.
Alan M. FriezeWesley PegdenPublished in: CoRR (2016)
Keyphrases
- average case
- worst case
- worst case analysis
- approximation algorithms
- np hard
- uniform distribution
- traveling salesman problem
- agnostic learning
- learning curves
- optimal solution
- euclidean distance
- combinatorial optimization
- lower bound
- upper bound
- search space
- computational complexity
- average case complexity
- data sets
- theoretical analysis