I have a graph of Points G(V,E) and I want to find the shortest path covering all the edge, I want the minimum number of edge repetitions . Which is the best way to reduce this problem to well know problems like TSP , Hamiltonian circuit , Hamltonian completion ?

Thank you.