scientific article; zbMATH DE number 1985657

zbMATH Open1033.90096MaRDI QIDQ4429355FDOQ4429355

Authors: Eh. Kh. Gimadi, Alexei E. Baburin 

Publication date: 25 September 2003

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4068645
• scientific article; zbMATH DE number 6007868
• Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
• Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
• Approximation algorithms for the TSP with sharpened triangle inequality
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
• Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP
• scientific article; zbMATH DE number 1855663
• scientific article; zbMATH DE number 706869
• On the approximability of the traveling salesman problem (extended abstract)

zbMATH Keywords

multigraphcombinatorial optimizationmatchingHamiltonian cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35)

Cited In (3)

• Title not available (Why is that?)
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
• Title not available (Why is that?)

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 Q4429355)