Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem
| Year of publication: |
2021
|
|---|---|
| Authors: | Ran, Yingli ; Zhang, Zhao ; Tang, Shaojie ; Du, Dingzhu |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 2, p. 774-784
|
| Subject: | partial set multicover | minimum k union | approximation algorithm | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Approximation algorithms for a new truck loading problem in urban freight transportation
Fan, Jie, (2020)
-
Bicriteria approximation of chance-constrained covering problems
Xie, Weijun, (2020)
-
The provably good parallel seeding algorithms for the k-means problem with penalties
Li, Min, (2022)
- More ...
-
A new approximation algorithm for minimum-weight (1,m)–connected dominating set
Zhou, Jiao, (2025)
-
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
Zhang, Yaoyao, (2024)
-
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao, (2018)
- More ...