The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Various optimizers for single‐stage production
Smith, W. E. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030106 · Cited by 1,831
The budgeted maximum coverage problem
Khuller, S., Moss, A., & Naor, J. (. (1999) · Information Processing Letters · doi:10.1016/s0020-0190(99)00031-9 · Cited by 982
Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
Approximation Algorithms for the Set Covering and Vertex Cover Problems
Hochbaum, D. S. (1982) · SIAM Journal on Computing · doi:10.1137/0211045 · Cited by 506
A linear-time approximation algorithm for the weighted vertex cover problem
Bar-Yehuda, R., & Even, S. (1981) · Journal of Algorithms · doi:10.1016/0196-6774(81)90020-1 · Cited by 430
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
Frieze, A., & Jerrum, M. (1997) · Algorithmica · doi:10.1007/bf02523688 · Cited by 406
Approximate Algorithms for the 0/1 Knapsack Problem
Sahni, S. (1975) · Journal of the ACM · doi:10.1145/321864.321873 · Cited by 349
New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
Goemans, M. X., & Williamson, D. P. (1994) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480192243516 · Cited by 227
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Shanmugam, K., Golrezaei, N., Dimakis, A. G., Molisch, A. F., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2281606 · Cited by 1,246
Submodular Function Maximization
Krause, A., & Golovin, D. (2014) · Tractability · doi:10.1017/cbo9781139177801.004 · Cited by 751
Optimal approximation for the submodular welfare problem in the value oracle model
Vondrak, J. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374389 · Cited by 546
Influence-Based Community Partition With Sandwich Method for Social Networks
Ni, Q., Guo, J., Wu, W., & Wang, H. (2023) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2022.3148411 · Cited by 265
Metadata
- Authors
- Ageev, A. A., & Sviridenko, M. I.
- Venue
- Journal of Combinatorial Optimization
- Published
- 2004-09
- Volume
- 8
- Issue
- 3
- Pages
- 307-328
- ISSN
- 1382-6905 (ISSN-L)
- 1573-2886
- OpenAlex
- W2072291569
- Cited by
- 363
- References
- 15
- FWCI
- 5.78
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. https://app.cochat.ai/papers/10.1023/b:joco.0000038913.96607.c2
- The paper
- Ageev, A. A., & Sviridenko, M. I. (2004). Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. Journal of Combinatorial Optimization. https://doi.org/10.1023/b%3Ajoco.0000038913.96607.c2
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.