The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
On the ratio of optimal integral and fractional covers
Lovász, L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90058-8 · Cited by 1,114
On the Complexity of Timetable and Multicommodity Flow Problems
Even, S., Itai, A., & Shamir, A. (1976) · SIAM Journal on Computing · doi:10.1137/0205048 · Cited by 1,057
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 570
On the complexity of time table and multi-commodity flow problems
Even, S., Itai, A., & Shamir, A. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.21 · Cited by 431
On the Distribution of the Number of Successes in Independent Trials
Hoeffding, W. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728178 · Cited by 374
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
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Virtual Network Embedding with Coordinated Node and Link Mapping
Chowdhury, N. M. M. K., Rahman, M. R., & Boutaba, R. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5061987 · Cited by 823
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Chowdhury, M., Rahman, M. R., & Boutaba, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2159308 · Cited by 818
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5_16 · Cited by 579
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Plotkin, S. A., Shmoys, D. B., & Tardos, É. (1995) · Mathematics of Operations Research · doi:10.1287/moor.20.2.257 · Cited by 542
The Critical Node Detection Problem in networks: A survey
Lalou, M., Tahraoui, M. A., & Kheddouci, H. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.02.002 · Cited by 311
Korte, B., & Vygen, J. (2002) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21711-5_16 · Cited by 273
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Buchbinder, N., & (Seffi) Naor, J. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982179 · Cited by 260
Rossi, F., Zhang, R., Hindy, Y., & Pavone, M. (2018) · Autonomous Robots · doi:10.1007/s10514-018-9750-5 · Cited by 153
Low depth mechanisms for quantum optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2020) · arXiv · doi:10.48550/arxiv.2008.08615 · Cited by 45
Metadata
- Authors
- Raghavan, P., & Tompson, C. D.
- Venue
- Combinatorica
- Published
- 1987-12
- Volume
- 7
- Issue
- 4
- Pages
- 365-374
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2022191808
- Cited by
- 1,010
- References
- 8
- FWCI
- 2.83
- 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
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.