most recent 30 from http://mathoverflow.net 2013-05-21T23:07:23Z http://mathoverflow.net/feeds/question/70543 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/70543/edge-covering-shortest-path Denis 2011-07-17T09:37:18Z 2011-07-17T20:27:27Z

<p>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 ?</p> <p>Thank you.</p>

http://mathoverflow.net/questions/70543/edge-covering-shortest-path/70566#70566 Max Alekseyev 2011-07-17T20:14:57Z 2011-07-17T20:27:27Z

<p>That is Chinese Postman Path. Search for Chinese Postman Problem...</p> <p>E.g., this section from some book looks comprehensive: <a href="http://academic.cankaya.edu.tr/~kandiller/eski_ie454/Chp-03%20044-064.pdf" rel="nofollow">http://academic.cankaya.edu.tr/~kandiller/eski_ie454/Chp-03%20044-064.pdf</a></p>