An Improved Memetic Algorithm for the Partial Vertex Cover Problem
As a generalized form of the classical minimum vertex cover problem (MVCP), the minimum partial vertex cover problem not only inherits the value of MVCP in both theoretical and practical research but also extends the application scenarios under the current era of big data. In order to solve such a c...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
IEEE
2019-01-01
|
| coleção: | IEEE Access |
| Assuntos: | |
| Acesso em linha: | https://ieeexplore.ieee.org/document/8631135/ |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|