scientific article; zbMATH DE number 598850

MaRDI QIDQ4297219zbMATH OpenFDO

Authors Bojan Mohar

Publication date 3 July 1994

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Parallel algorithms in computer science (68W10) Programming involving graphs or networks (90C35)

Recommendations

• Approximation algorithms for the traveling salesman problem
• The traveling salesman problem. Approximate algorithms
• scientific article; zbMATH DE number 4095236
• An approximation algorithm for the maximum traveling salesman problem
• An approximation algorithm for the maximum traveling salesman problem
• scientific article; zbMATH DE number 7300320
• An approximation algorithm for the TSP
• On the approximability of the traveling salesman problem
• scientific article; zbMATH DE number 4031726
• An approximation algorithm for a bottleneck traveling salesman problem

Cited in

(6)

• On the approximability of the traveling salesman problem
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
• scientific article; zbMATH DE number 4031726 (Why is no real title available?)
• scientific article; zbMATH DE number 2080248 (Why is no real title available?)
• scientific article; zbMATH DE number 1534500 (Why is no real title available?)
• scientific article; zbMATH DE number 7059568 (Why is no real title available?)

This page was built for publication:

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