Reference health
Approximation algorithm for minimum partial multi-cover under a geometric setting
18/18 checkable references clean · checked 2026-08-10
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
6 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 18 checked references that resolve
resolves10.1137/1.9781611973099.125
Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling
resolves10.1016/j.comgeo.2014.12.005
Geometric red–blue set cover for unit squares and related problems
resolves10.1145/2455.214106
Approximation schemes for covering and packing problems in image processing and VLSI
resolves10.1145/3055399.3055412
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
resolves10.1007/s10878-016-0005-0
Approximation algorithm for partial positive influence problem in social network
resolves10.1007/s10878-019-00513-y
A primal-dual algorithm for the minimum partial set multi-cover problem
resolves10.1287/ijoc.2020.0975
Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
resolves10.1016/j.tcs.2019.03.004
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
The 6 references without a DOI — listed, not checked
no DOI — not checkedBansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. ESA LNCS 7501, 145–156 (2012)
no DOI — not checkedChlamtáč, E., Dinitz, M., Makarychev, Y.: Minimizing the union: tight approximations for small set bipartite vertex expansion. In: SODA’17, pp. 881–899
no DOI — not checkedInamdar, T.: Local search for geometric partial covering problems. In: CCCG2019, Edmonton, pp. Canada, 242–249 (2019)
no DOI — not checkedInamdar, T., Varadarajan. K.R.: On partial covering for geometric set systems. In: 34th International Symposium on Computational Geometry, pp. 47:1–47:14 (2018)
no DOI — not checkedVazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)
no DOI — not checkedZhang, Z., Shi, Y., Willson, J., Du, D.-Z., Tong, G.: Viral marketing with positive influence. In: INFOCOM2017, Atlanta, GA, USA, May 1–4, pp. 1–8
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-08-10 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1007/s11590-021-01746-9"><img src="https://citestamp.com/citestamped/10.1007/s11590-021-01746-9/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/s11590-021-01746-9)