Reference health
PTAS for Densest k-Subgraph in Interval Graphs
16/16 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.
1 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 16 checked references that resolve
resolves10.1145/290179.290180
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
resolves10.1006/jcss.1998.1605
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
resolves10.1016/j.ipl.2010.05.011
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs
resolves10.1006/jagm.2001.1183
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
resolves10.1145/321906.321909
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
resolves10.1137/S0097539705447037
Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
resolves10.1016/j.ipl.2008.03.016
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
The 1 reference without a DOI — listed, not checked
no DOI — not checkedLawler, E.L.: Combinatorial optimization - networks and matroids. Holt, Rinehart and Winston, New York (1976)
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/978-3-642-22300-6_53"><img src="https://citestamp.com/citestamped/10.1007/978-3-642-22300-6_53/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/978-3-642-22300-6_53)