Author of the publication

The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On data reduction for dynamic vector bin packing., , , and . CoRR, (2022)Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem., and . AIST, volume 10716 of Lecture Notes in Computer Science, page 304-312. Springer, (2017)On data reduction for dynamic vector bin packing., , , and . Oper. Res. Lett., 51 (4): 446-452 (July 2023)Parameterized algorithms and data reduction for the short secluded s-t-path problem., , and . Networks, 75 (1): 34-63 (2020)The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable., , and . CoRR, (2020)Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU., , , , and . CoRR, (2021)On approximate data reduction for the Rural Postman Problem: Theory and experiments., , and . Networks, 76 (4): 485-508 (2020)Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs., and . LION, volume 11968 of Lecture Notes in Computer Science, page 201-207. Springer, (2019)Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU., , , , and . J. Comput. Syst. Sci., (February 2024)Representative families for matroid intersections, with applications to location, packing, and covering problems., , and . Discret. Appl. Math., (2021)