Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances

zbMATH Open1249.90299MaRDI QIDQ3115676FDOQ3115676

Authors: Eh. Kh. Gimadi, A. le Gallu, A. V. Shakhshneider 

Publication date: 10 February 2012

Recommendations

• scientific article; zbMATH DE number 808804
• Probabilistic Algorithm for the Directed Traveling Salesman Problem
• Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above
• scientific article; zbMATH DE number 3932819
• scientific article; zbMATH DE number 706869

zbMATH Keywords

traveling salesman problemNP-hard problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (8)

• Title not available (Why is that?)
• Probabilistic Algorithm for the Directed Traveling Salesman Problem
• Title not available (Why is that?)
• Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
• On the nearest-neighbor algorithm for the mean-field traveling salesman problem
• Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above
• Title not available (Why is that?)
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below

This page was built for publication: Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances

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