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

DOI

https://doi.org/10.1002/net.21985
Final published version

Original language	English
Article number	e21985
Pages (from-to)	485-508
Number of pages	24
Journal	Networks
Volume	76
Issue number	4
Early online date	6 Oct 2020
DOIs	https://doi.org/10.1002/net.21985
Publication status	Published - 1 Dec 2020

Research areas

above-guarantee parameterization, capacitated arc routing, Eulerian extension, lossy kernelization, NP-hard problem, parameterized complexity, EULERIAN EXTENSION, ARC, BOUNDS, ALGORITHM

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES
5.02.PE OPERATIONS RESEARCH & MANAGEMENT SCIENCE

ID: 25606690