The maximum independent set problem is of central importance combinatorial optimization problem. It has many practical applications in science and engineering. In this paper, we propose a genetic ...

Additionally, confusion matrices for the open-set problem are produced and saved in in figures/<run-name>. In Figure 4 and 5 of our paper we also explore additional factors that could affect the final ...

We prove that the BHTA problem is NP-hard. Subsequently, we propose a constant-ratio approximation algorithm based on partition and shifting method to achieve the assignment solution. To meet with the ...