Narrow search
Showing 1 - 4 of 4
Cover Image
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao; Zhou, Jiao; Tang, Shaojie; Huang, Xiaohui; … - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 217-224
Persistent link: https://www.econbiz.de/10011878225
Cover Image
Breaking the O(In n) barrier : an enhanced approximation algorithm for fault-tolerant minimum weight connected dominating set
Zhou, Jiao; Zhang, Zhao; Tang, Shaojie; Huang, Xiaohui; … - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 225-235
Persistent link: https://www.econbiz.de/10011878228
Cover Image
Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem
Ran, Yingli; Zhang, Zhao; Tang, Shaojie; Du, Dingzhu - In: INFORMS journal on computing : JOC 33 (2021) 2, pp. 774-784
Persistent link: https://www.econbiz.de/10012546227
Cover Image
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
Zhang, Yaoyao; Zhu, Chaojie; Tang, Shaojie; Ran, Yingli; … - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 2, pp. 510-525
Persistent link: https://www.econbiz.de/10014532309