Bottleneck assignment problems under categorization
Computers and Operations Research
Steiner problem in Halin networks
Discrete Applied Mathematics
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis
Journal of the ACM (JACM)
A characterization and efficient reliability computation of delta-y reducible networks
A characterization and efficient reliability computation of delta-y reducible networks
Why certain subgraph computations requite only linear time
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Guaranteed performance heuristics for the bottleneck travelling salesman problem
Operations Research Letters
A fast method for large-scale multichromosomal breakpoint median problems
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Labeled Traveling Salesman Problems: Complexity and approximation
Discrete Optimization
Erratum: On: Travelling salesman problem under categorization
Operations Research Letters
Categorized bottleneck-minisum path problems on networks
Operations Research Letters
A probabilistic analysis of christofides' algorithm
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The uncapacitated asymmetric traveling salesman problem with multiple stacks
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
We introduce two new classes of traveling salesman problems (TSP1 and TSP2) which subsume the classical traveling salesman problem and the bottleneck traveling salesman problem. It is shown that these problems are strongly NP-complete on Halin graphs eventhough their extreme cases (i.e. traveling salesman problem and bottleneck traveling salesman problem) are solvable in polynomial time on such graphs. It is also shown that TSP2 is solvable in polynomial time on Halin graphs if an associated parameter p is fixed, but TSP1 still remains NP-complete. For TSP2, a polynomial time (for fixed p) heuristic is suggested which produces a solution whose objective function value is no worse than twice that of the optimal solution whenever the underlying graph is complete, undirected and edge weights satisfy the triangle inequality.