The DOI matches its Crossref record.
Finding k Cuts within Twice the Optimal
Abstract
Two simple approximation algorithms for the minimum k-cut problem are presented. Each algorithm finds a k cut having weight within a factor of $(2 - 2/k)$ of the optimal. One algorithm is particularly efficient—it requires a total of only $n - 1$ maximum flow computations for finding a set of near-optimal k cuts, one for each value of k between 2 and n.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Meng, X., Pappas, V., & Zhang, L. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461930 · Cited by 935
Network-Aware Virtual Machine Placement and Migration in Cloud Data Centers
Ferdaus, M. H., Murshed, M., Calheiros, R. N., & Buyya, R. (2015) · Advances in Systems Analysis, Software Engineering, and High Performance Computing · doi:10.4018/978-1-4666-8213-9.ch002 · Cited by 38
Metadata
- Authors
- Saran, H., & Vazirani, V. V.
- Venue
- SIAM Journal on Computing
- Published
- 1995-02
- Volume
- 24
- Issue
- 1
- Pages
- 101-108
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2122466336
- Cited by
- 195
- References
- 0
- FWCI
- 0.51
- 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: Finding k Cuts within Twice the Optimal. https://app.cochat.ai/papers/10.1137/s0097539792251730
- The paper
- Saran, H., & Vazirani, V. V. (1995). Finding k Cuts within Twice the Optimal. SIAM Journal on Computing. https://doi.org/10.1137/s0097539792251730
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.