Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio

DOI10.1287/IJOC.2022.0327MaRDI QIDQ6580540zbMATH OpenFDO

Authors Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Yingli Ran, Du Ding-Zhu, Zhao Zhang

Publication date 29 July 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2022.0327

zbMATH Keywords

approximation ratioevolutionary algorithmminimum connected dominating setminimum submodular coverminimum weight general cover

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580540)