{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreid3m7h5lfcaq6vhs2yugwk4h3xlewfj6kabhijek6z3eozn7sa7ae",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mof4gyqtujp2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2606.15324v1",
  "publishedAt": "2026-06-16T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Qi Duan"
  ],
  "textContent": "**Authors:** Qi Duan\n\nWe study threshold minimum cut problems with a distinguished root vertex, a set of terminals, and a quota. In the threshold minimum edge cut problem (\\TMEC), the goal is to find a minimum-cost edge cut that disconnects at least $k$ terminals from the root. In the threshold minimum node cut problem (\\TMNC), the goal is to delete a minimum-cost set of nonterminal, nonroot vertices so that at least $k$ terminals become disconnected from the root. We prove three approximation guarantees. First, undirected general-graph \\TMEC{} admits a randomized polynomial-time expected $O(\\log n)$ approximation via a Räcke-style cut-dominating tree decomposition and an exact dynamic program on trees. A standard repetition argument gives the same asymptotic ratio with high probability. Second, planar \\TMEC{} admits a factor-$2$ approximation by reducing the threshold condition to planar weighted balanced cut. Third, bounded-degree planar \\TMNC{} admits a $2Δ$-approximation, where $Δ$ is the maximum degree of a deletable vertex, by reducing the node-cost problem to the planar edge-cut problem on the same graph. The results separate exact-quota guarantees from bicriteria small-set-expansion-type guarantees and identify the unbounded-degree planar node-cut case as the main remaining obstacle.",
  "title": "Threshold Minimum Cut with Terminal Quotas: Logarithmic and Planar Approximation Algorithms"
}