A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph

DOI10.1016/S0020-0190(98)00094-5zbMath1337.90054MaRDI QIDQ293330

Jeffrey Mark Phillips, Abraham P. Punnen, Santosh N. Kabadi

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000945?np=y

zbMATH Keywords

computational complexitypolynomial algorithmsbottleneck traveling salesman problemHalin graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items

Multiobjective traveling salesperson problem on Halin graphs ⋮ A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ A survey of very large-scale neighborhood search techniques

Cites Work

• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• The Bottleneck Traveling Salesman Problem
• Halin graphs and the travelling salesman problem
• Bottleneck extrema
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph