figshare
Browse
dr-poster.pdf (1.62 MB)

On approximate data reduction for the Rural Postman Problem

Download (1.62 MB)
Version 2 2020-10-18, 05:39
Version 1 2020-10-07, 02:33
poster
posted on 2020-10-18, 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

Usage metrics

    Categories

    Keywords

    Eulerian extensioncapacitated arc routinglossy kernelizationabove-guarantee parameterizationNP-hard problemparameterized complexityApplied Discrete MathematicsCombinatorics and Discrete Mathematics (excl. Physical Combinatorics)Operations ResearchOptimisationAnalysis of Algorithms and Complexity

    Licence

    CC BY 4.0

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC