On approximate data reduction for the Rural Postman Problem: Theory and experiments Full article
| Journal |
Networks
ISSN: 0028-3045 , E-ISSN: 1097-0037 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2020, Volume: 76, Number: 4, Pages: 485-508 Pages count : 24 DOI: 10.1002/net.21985 | ||||||
| Tags | above-guarantee parameterization; capacitated arc routing; Eulerian extension; lossy kernelization; NP-hard problem; parameterized complexity | ||||||
| Authors |
|
||||||
| Affiliations |
|
Cite:
Bevern R.
, Fluschnik T.
, Tsidulko O.Y.
On approximate data reduction for the Rural Postman Problem: Theory and experiments
Networks. 2020. V.76. N4. P.485-508. DOI: 10.1002/net.21985 WOS Scopus OpenAlex
On approximate data reduction for the Rural Postman Problem: Theory and experiments
Networks. 2020. V.76. N4. P.485-508. DOI: 10.1002/net.21985 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000575306500001 |
| Scopus: | 2-s2.0-85084978725 |
| OpenAlex: | W2984315191 |