Computational complexity of one step and heuristics for the Eternal Vertex Cover Problem - Conference attendances

Computational complexity of one step and heuristics for the Eternal Vertex Cover Problem Conference attendances

Language

Английский

Participant type

Секционный

Conference

XXIV International conference “Mathematical Optimization Theory and Operations Research”
07-11 Jul 2025 , Новосибирск

Authors

Utyupin S. ¹ , Melnikov A. ¹ , Beresnev V. ¹

Affiliations

1	Sobolev Institute of Mathematics

Utyupin S. , Melnikov A. , Beresnev V.
Computational complexity of one step and heuristics for the Eternal Vertex Cover Problem
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 Jul 2025