On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem

DOI10.1007/978-3-030-22629-9_20zbMath1443.90303OpenAlexW2951385657MaRDI QIDQ2181766

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

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_20

zbMATH Keywords

parameterized complexityEulerian extensionlossy kernelization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

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

This page was built for publication: On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem