8 citations · 8 across the 1 of their papers we have counts for
3 papers
cs.DS2020★ 8 cited
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable
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…
cs.DS2018
On approximate data reduction for the Rural Postman Problem: Theory and experiments
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Given an undirected graph with edge weights and a subset of its edges, the Rural Postman Problem (RPP) is to find a closed walk of minimum total weight containing all edges of…
cs.DS2018
Parameterized algorithms and data reduction for the short secluded --path problem
René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
Given a graph , two vertices , and two integers , the Short Secluded Path problem is to find a simple --path with at most vertices and n…