O. Tsidulko

activity

20182022

most citedOn approximate data reduction for the Rural Postman Problem: Theory and experiments

11 citations · 31 across the 6 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

cs.DS2018★ 11 cited

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 $R$ of its edges, the Rural Postman Problem (RPP) is to find a closed walk of minimum total weight containing all edges of…

cs.DS2018★ 2 cited

Representative families for matroid intersections, with applications to location, packing, and covering problems

René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location p…

cs.DS2018★ 6 cited

Parameterized algorithms and data reduction for the short secluded $s$ - $t$ -path problem

René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

Given a graph $G = (V, E)$ , two vertices $s, t \in V$ , and two integers $k, ℓ$ , the Short Secluded Path problem is to find a simple $s$ - $t$ -path with at most $k$ vertices and $ℓ$ n…

On approximate data reduction for the Rural Postman Problem: Theory and experiments

Representative families for matroid intersections, with applications to location, packing, and covering problems

Parameterized algorithms and data reduction for the short secluded s-t-path problem

Parameterized algorithms and data reduction for the short secluded $s$ - $t$ -path problem