Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
Year of publication: |
2024
|
---|---|
Authors: | Zhang, Yaoyao ; Zhu, Chaojie ; Tang, Shaojie ; Ran, Yingli ; Du, Dingzhu ; Zhang, Zhao |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 2, p. 510-525
|
Subject: | approximation ratio | evolutionary algorithm | minimum connected dominating set | minimum submodular cover | minimum weight general cover | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Evolutionsökonomik | Evolutionary economics |
-
Jeong, Young-Seon, (2015)
-
Robust evolutionary algorithm design for socio-economic simulation : some comments
Waltman, Ludo, (2009)
-
Guédas, Benoît, (2011)
- More ...
-
Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem
Ran, Yingli, (2021)
-
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao, (2018)
-
Zhou, Jiao, (2018)
- More ...