A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
classification
💻 cs.GT
cs.DMcs.DS
keywords
algorithmapproximationmaximumproblemsalesmantravelinggive
read the original abstract
We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.