On $$(1+\varepsilon )$$ -approximate Data Reduction for the Rural Postman Problem-Reference-Cited by-同舟云学术

On $$(1+\varepsilon )$$ -approximate Data Reduction for the Rural Postman Problem

Published:2019 Issue: Volume: Page:279-294
ISSN:0302-9743
Container-title:Mathematical Optimization Theory and Operations Research
language:
Short-container-title:

Author:

van Bevern René^ORCID,Fluschnik Till^ORCID,Tsidulko Oxana Yu.^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-22629-9_20

Reference35 articles.

1. Belenguer, J.M., Benavent, E., Lacomme, P., Prins, C.: Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33(12), 3363–3383 (2006)

2. van Bevern, R., Fluschnik, T., Tsidulko, O.Yu.: Parameterized algorithms and data reduction for safe convoy routing. In: Proceedings of 18th ATMOS, OASIcs, vol. 65, pp. 10:1–10:19. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2018)

3. van Bevern, R., Hartung, S., Nichterlein, A., Sorge, M.: Constant-factor approximations for capacitated arc routing without triangle inequality. Oper. Res. Lett. 42(4), 290–292 (2014)

4. van Bevern, R., Komusiewicz, C., Sorge, M.: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: theory and experiments. Networks 70(3), 262–278 (2017)

5. van Bevern, R., Niedermeier, R., Sorge, M., Weller, M.: Complexity of arc routing problems. In: Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization, vol. 20. SIAM (2014)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On approximate data reduction for the Rural Postman Problem: Theory and experiments;Networks;2020-10-06