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

DOI10.1016/S0020-0190(98)00094-5zbMATH Open1337.90054MaRDI QIDQ293330FDOQ293330

Authors: 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

Recommendations

• Traveling salesman problem under categorization
• Steiner problem in Halin networks
• Multiobjective traveling salesperson problem on Halin graphs
• Publication:3484353
• A linear time algorithm for the bottleneck biconnected spanning subgraph problem

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)

Cites Work

• Title not available (Why is that?)
• Halin graphs and the travelling salesman problem
• Bottleneck extrema
• The Bottleneck Traveling Salesman Problem
• Title not available (Why is that?)
• Guaranteed performance heuristics for the bottleneck traveling salesman problem

Cited In (6)

• Traveling salesman problem under categorization
• A survey of very large-scale neighborhood search techniques
• Experimental analysis of heuristics for the bottleneck traveling salesman problem
• Title not available (Why is that?)
• Multiobjective traveling salesperson problem on Halin graphs
• A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293330)