Reference health

A primal-dual algorithm for the minimum partial set multi-cover problem

https://doi.org/10.1007/s10878-019-00513-y
CiteStamped reference-health badge
23/23 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.

5 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 23 checked references that resolve
resolves10.1016/S0304-0208(08)73101-3
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
resolves10.1006/jagm.2000.1150
Using Homogeneous Weights for Approximating the Partial Cover Problem
resolves10.1145/1806689.1806719
Detecting high log-densities
resolves10.1137/08073617X
On the Approximability of Influence in Social Networks
resolves10.1287/moor.4.3.233
A Greedy Heuristic for the Set-Covering Problem
resolves10.1007/s10878-012-9530-7
On the approximability of positive influence dominating set in social networks
resolves10.1145/2591796.2591884
Analytical approach to parallel repetition
resolves10.1016/S0166-218X(02)00458-4
A push-relabel framework for submodular function minimization and applications to parametric optimization
resolves10.1016/j.jalgor.2004.04.002
Approximation algorithms for partial covering problems
resolves10.1137/0211045
Approximation Algorithms for the Set Covering and Vertex Cover Problems
resolves10.1016/S0022-0000(74)80044-9
Approximation algorithms for combinatorial problems
resolves10.1007/978-1-4684-2001-2_9
Reducibility among Combinatorial Problems
resolves10.1145/956750.956769
Maximizing the spread of influence through a social network
resolves10.1007/11523468_91
Influential Nodes in a Diffusion Model for Social Networks
resolves10.1016/j.jcss.2007.06.019
Vertex cover might be hard to approximate to within<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:mo>−</mml:mo><mml:mi>ε</mml:mi></mml:math>
resolves10.1016/0012-365X(75)90058-8
On the ratio of optimal integral and fractional covers
resolves10.1007/978-3-642-68874-4_10
Submodular functions and convexity
resolves10.1145/3055399.3055412
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
resolves10.1109/SFCS.1993.366855
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
resolves10.1007/s10878-016-0005-0
Approximation algorithm for partial positive influence problem in social network
resolves10.1007/s10878-016-0066-0
Local ratio method on partial set multi-cover
resolves10.1016/S0020-0190(97)00182-8
Improved performance of the greedy algorithm for partial cover
resolves10.1016/j.tcs.2009.10.001
On positive influence dominating sets in social networks
The 5 references without a DOI — listed, not checked
no DOI — not checkedEdmonds J (1970) Submodular functions, matroids, and certain polyhedra. In: Guy R, Hanani H, Sauer N, Schönheim J (eds) Combinatorial structures and their applications. Gordon and Breach, New York, pp 69–87
no DOI — not checkedFeige U (1996) A threshold of $$\ln n$$ for approximating set cover. In: STOC, pp 312–318
no DOI — not checkedKearns M, Ortiz L (2003) Algorithms for interdependent security games. In: NIPS, pp 288–297
no DOI — not checkedVazirani VV (2001) Approximation algorithms. Springer, Berlin
no DOI — not checkedWang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. COCOA LNCS 5573:313–321
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

view as graph · paper page

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/s10878-019-00513-y"><img src="https://citestamp.com/citestamped/10.1007/s10878-019-00513-y/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/s10878-019-00513-y/badge.svg)](https://citestamp.com/citestamped/10.1007/s10878-019-00513-y)