Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The online covering algorithm from [14] is ∆-competitive, where ∆ is the maximum number of variables in any constraint.
“This algorithm is ∆-competitive, where ∆ is the maximum number of variables in any constraint.”
From Caching with rental cost and zapping (2012) · cites this paper as [14]
The direct application of the online covering approach yields sub-optimal algorithms in some of the cases studied in this paper.
“The direct application of this approach yields sub-optimal algorithms in some of the cases we study in this paper.”
From Caching with rental cost and zapping (2012) · cites this paper as [14]
Cites
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631 · cited 2× · see citing works
“Examples include rent-or-buy [36,40], paging [23,43], weighted caching [2,14], connection caching [18], and file caching [3].”
BackgroundFiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., & Young, N. E. (1991) · Journal of Algorithms · doi:10.1016/0196-6774(91)90041-v · Cited by 457 · see citing works
Self-citationA strongly competitive randomized paging algorithm
McGeoch, L. A., & Sleator, D. D. (1991) · Algorithmica · doi:10.1007/bf01759073 · Cited by 238 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Caching with rental cost and zapping
Khare, M., & Young, N. E. (2012) · arXiv · doi:10.48550/arxiv.1208.2724 · Cited by 1 · see citing works
Self-citation
- Authors
- Koufogiannakis, C., & Young, N. E.
- Affiliations
- University of California, Riverside (US)
- ORCID
- Young, Neal E.
- Venue
- Algorithmica
- Published
- 2012-03-14
- Volume
- 66
- Issue
- 1
- Pages
- 113-152
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2174359169
- Cited by
- 53
- References
- 3
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 2 · 2023: 3 · 2022: 1 · 2021: 4 · 2020: 1 · 2019: 4 · 2018: 4 · 2017: 4 · 2016: 6 · 2015: 3 · 2014: 4 · 2013: 2 · 2012: 4
- FWCI
- 4.25
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithmica (publishedVersion)
- eScholarship (California Digital Library) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computer Networks and Communications › Optimization and Search Problems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- greedy approximation algorithm, covering problems, vertex cover, online caching, approximation algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
