A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
Information Processing Letters
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
Discrete Applied Mathematics
A linear time algorithm for the bottleneck biconnected spanning subgraph problem
Information Processing Letters
An upper bound for the hamilitonicity exponent of finite digraphs
Selected papers from the second Krakow conference on Graph theory
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis
Journal of the ACM (JACM)
On the Maximum Scatter Traveling Salesperson Problem
SIAM Journal on Computing
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Assignment Problems
Transforming asymmetric into symmetric traveling salesman problems
Operations Research Letters
Guaranteed performance heuristics for the bottleneck travelling salesman problem
Operations Research Letters
Experimental analysis of heuristics for the bottleneck traveling salesman problem
Journal of Heuristics
| Hi-index | 0.01 |
We consider the asymmetric bottleneck traveling salesman problem on a complete directed graph on n nodes. Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time @?n/2@?-approximation algorithm is presented when the edge-weights satisfy the triangle inequality. We also present a very efficient heuristic algorithm that produced provably optimal solutions for 270 out of 331 benchmark test instances. Our algorithms are applicable to the maxmin version of the problem, known as the maximum scatter TSP. Extensive experimental results on these instances are also given.