11 citations · 31 across the 6 of their papers we have counts for
1 paper · 1 filter
Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
The Hierarchical Chinese Postman Problem is finding a shortest traversal of all edges of a graph respecting precedence constraints given by a partial order on classes of edges. We…