{"paper":{"title":"Brief Announcement: Almost-Tight Approximation Distributed Algorithm for Minimum Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai","submitted_at":"2014-03-24T23:18:37Z","abstract_excerpt":"In this short paper, we present an improved algorithm for approximating the minimum cut on distributed (CONGEST) networks. Let $\\lambda$ be the minimum cut. Our algorithm can compute $\\lambda$ exactly in $\\tilde{O}((\\sqrt{n}+D)\\poly(\\lambda))$ time, where $n$ is the number of nodes (processors) in the network, $D$ is the network diameter, and $\\tilde{O}$ hides $\\poly\\log n$. By a standard reduction, we can convert this algorithm into a $(1+\\epsilon)$-approximation $\\tilde{O}((\\sqrt{n}+D)/\\poly(\\epsilon))$-time algorithm. The latter result improves over the previous $(2+\\epsilon)$-approximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6188","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}