On approximate data reduction for the Rural Postman Problem: Theory and experiments-Reference-Cited by-同舟云学术

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

Published:2020-10-06 Issue:4 Volume:76 Page:485-508
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Bevern René¹^ORCID,Fluschnik Till²^ORCID,Tsidulko Oxana Yu.¹³^ORCID

Affiliation:

1. Department of Mathematics and Mechanics Novosibirsk State University Novosibirsk Russian Federation

2. Faculty IV, Algorithmics and Computational Complexity Technische Universität Berlin Berlin Germany

3. Sobolev Institute of Mathematics Siberian Branch of the Russian Academy of Sciences Novosibirsk Russian Federation

Funder

Deutsche Forschungsgemeinschaft

Russian Foundation for Basic Research

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21985

Reference59 articles.

1. Experiments on data reduction for optimal domination in networks

2. Lower and upper bounds for the mixed capacitated arc routing problem

3. M.Bentert R.vanBevern T.Fluschnik A.Nichterlein andR.Niedermeier Polynomial‐time data reduction for weighted problems beyond additive goal functions 2020 https://arxiv.org/abs/1910.00277.

4. Lecture Notes in Computer Science;Bentert M.,2017

5. Lecture Notes in Computer Science;Bevern R.,2019

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

1. Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU;Journal of Computer and System Sciences;2024-02

2. Polynomial-time data reduction for weighted problems beyond additive goal functions;Discrete Applied Mathematics;2023-03

3. Approximation algorithms for some Minimum Postmen Cover Problems;Discrete Applied Mathematics;2022-10

4. Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments;INFORMS Journal on Computing;2021-06-03

5. The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable;Operations Research Letters;2021-03