The maximum weighted k distance-d independent set problem on interval graph

Abstract

In this paper, we consider a maximum weighted k distance-d independent set problem, which is a variant of maximum weighted distance-d independent set problems, on interval graph. We propose a pseudo-polynomial time algorithm for maximum weighted k distance-d independent set problems on interval graphs, based on a solution to an exact weighted independent set problem. In addition, the performance of the proposed algorithm was evaluated by computational experiments. According to the experiments, it is found that the parameter k has a significant influence on the calculation time compared with parameters d, k