Category:Definitions/Chinese Postman Problems

This category contains definitions related to Chinese Postman Problems.
Related results can be found in Category:Chinese Postman Problems.

A Chinese postman problem is a problem in network theory equivalent to that of a postman who needs to:

visit all streets in an area to deliver letters

return to the starting point

covering the least possible distance.

Hence it is equivalent to finding a closed walk in a weighted graph which includes every edge with least total weight.