On the worst-case performance of some algorithms for the asymmetric traveling salesman problem.
Alan M. FriezeGiulia GalbiatiFrancesco MaffioliPublished in: Networks (1982)
Keyphrases
- worst case
- average case
- error bounds
- running times
- online algorithms
- learning algorithm
- worst case analysis
- computational cost
- computationally efficient
- convergence rate
- computational efficiency
- orders of magnitude
- times faster
- benchmark datasets
- machine learning algorithms
- significant improvement
- lower bound
- computer vision