Chinese postman's problem
Материал из WEGA
Chinese postman's problem --- задача китайского почтальона.
Let [math]\displaystyle{ G = (V,E) }[/math] be a connected undirected graph. A non-negative cost (or length) is associated with each edge of [math]\displaystyle{ G }[/math]. The Chinese postman's problem consists in determining a least-cost traversal of [math]\displaystyle{ G }[/math].
