The Christofides algorithm follows a similar outline but combines the minimum spanning tree with a solution of another problem, minimum-weight perfect matching.
Christofides algoritam sledi sličan nacrt već kombinuje minimalni Spanning Tree rastvorom drugog problema, minimalna težina-savršeno podudaranje.