# Tag Info

## New answers tagged approximation

### Reducing euclidean TSP of smaller size to euclidean TSP of bigger size

If you need a mathematical guarantee, you should run $k-1$ times the $N$-solver algorithm. In other words, repeat the following approach for each vertex $v_i\ \ i=2,...,k$ and take the best solution. ...
Summary: Start with a minimum spanning Tree (MST). Then modify it slightly to a Hamiltonian circuit. Mini-step traversal of $(T,s)$ Let $T$ be a tree. Definitions: For two vertices $u$ and $v$, let \$d(...