On approximate data reduction for the Rural Postman Problem

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

doi:10.6084/m9.figshare.13058969.v2

dr-poster.pdf (1.62 MB)

Download file

On approximate data reduction for the Rural Postman Problem

poster

posted on 18.10.2020, 05:39 authored by René van BevernRené van Bevern, Till Fluschnik, Oxana Yu. Tsidulko

Poster accompanying the article: R. van Bevern, T. Fluschnik, and O. Yu. Tsidulko, On approximate data reduction for the Rural Postman Problem, Networks, 2020.

Funding

Trade-offs in parameterized data reduction approaches

Russian Foundation for Basic Research

Find out more...

Ministry of Science and Higher Education of the Russian Federation, agreement No. 075-15-2019-1675

German Research Foundation, project NI 369/18

History

References

10.1002/net.21985

Usage metrics

Keywords

Eulerian extension capacitated arc routing lossy kernelization above-guarantee parameterization NP-hard problem parameterized complexity

Licence

CC BY 4.0

On approximate data reduction for the Rural Postman Problem

Funding

Trade-offs in parameterized data reduction approaches

Ministry of Science and Higher Education of the Russian Federation, agreement No. 075-15-2019-1675

German Research Foundation, project NI 369/18

History

References

Usage metrics

Categories

Keywords

Licence

Exports