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...
Збережено в:
| Автори: | , , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
IEEE
2019-01-01
|
| Серія: | IEEE Access |
| Предмети: | |
| Онлайн доступ: | https://ieeexplore.ieee.org/document/8631135/ |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|