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

MaRDI QIDQ3115676zbMATH OpenFDO

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

Publication date 10 February 2012

zbMATH Keywords

traveling salesman problemNP-hard problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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

Cited in

(8)

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

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)