Min-Max Coverage in Multi-interface Networks: Pathwidth
摘要
This paper delves into one of the problems within the class known as Multi-Interface Networks, specifically studying Coverage in Multi-Interface Networks. This class of problems has been extensively investigated by scholars due to its many applications in real-world scenarios. In this paper, we take into consideration the pathwidth of the networks. The primary reason for this focus is that the problem is challenging to solve on general networks. Additionally, we chose to analyze it using Fixed Parameter Tractability (FPT) theory. We show that the problem is in FPT with respect to the number of available interfaces plus the pathwidth.