All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 11:22, 15 February 2023 Admin talk contribs created page Approximate TSP (Created page with "{{DISPLAYTITLE:Approximate TSP (The Traveling-Salesman Problem)}} == Description == Approximate TSP is the problem of finding an approximate answer to Minimum TSP. In Minimum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that minimizes the length of the tour. This is the typical variation of TSP....")