This is one of the special cases for Chinese Postman Problem. I know the answer is (Cost of all Edges + Cost of shortest path between the odd degree vertices). How do I prove this?
I am trying to prove the solution to this UVA problem.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community