Parameterized complexity of k -Chinese Postman Problem-Reference-Cited by-同舟云学术

Parameterized complexity of k -Chinese Postman Problem

Published:2013-11 Issue: Volume:513 Page:124-128
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gutin Gregory,Muciaccia Gabriele,Yeo Anders

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Kernels: annotated, proper and induced;Abu-Khzam,2006

2. The Moore bound for irregular graphs;Alon;Graphs Comb.,2002

3. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009

4. R. van Bevern, R. Niedermeier, M. Sorge, M. Weller, Complexity of arc rooting problems, in: A. Corberán, G. Laporte (Eds.), Arc Routing: Problems, Methods and Applications, Chapter 2, SIAM, Philadelphia, in press.

5. Kernel bounds for disjoint cycles and disjoint paths;Bodlaender;Theor. Comput. Sci.,2011

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

1. Demo: LoRaWAN Coverage Assessment Using Optimal Bicycle Route Planning;2024 IEEE 49th Conference on Local Computer Networks (LCN);2024-10-08

2. Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover;Mathematical Methods of Operations Research;2022-12-07

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

4. Cycle Generating Algorithm for Solving Chinese Postman Problem;Modeling and Simulation;2022

5. Approximation algorithms for some min–max postmen cover problems;Annals of Operations Research;2021-03-06