An approximation algorithm for the maximum traveling salesman problem

From MaRDI portal

(Redirected from An approximation algorithm for the maximum traveling salesman problem)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_approximation_algorithm_for_the_maximum_traveling_salesman_problem&oldid=60704844"