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 |
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
-
Providing consistent opinions from online reviews : a heuristic stepwise optimization approach
Zhang, Zunqiang, (2016)
- More ...
-
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)
-
Zhou, Jiao, (2018)
- More ...