{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreid3ubw4x5fbqcnczgdmej67vy4rw3yqvz4hnzcd5xxc6ro2hwvuhq",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mnz63ar3rqz2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2606.11483v1",
  "publishedAt": "2026-06-11T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Qi Duan"
  ],
  "textContent": "**Authors:** Qi Duan\n\nWe study the undirected three-terminal reachability-preserving minimum edge cut problem. The input is an undirected graph $G=(V,E)$ with nonnegative edge costs, two protected terminals $s_1,s_2$, and a target terminal $t$. The goal is to remove a minimum-cost edge set so that $t$ is disconnected from the protected terminals while $s_1$ and $s_2$ remain connected. This problem captures a basic tension between separation and connectivity preservation. Prior work on connectivity-preserving cuts established polynomial-time solvability for some special cases, such as planar edge-cut instances, and strong hardness for node-cut variants, but a general-graph approximation guarantee for the undirected three-terminal edge-cut version does not appear to have been known. We give a polynomial-time $O(\\sqrt n)$-approximation algorithm in this paper. This is the first known approximation algorithm for the problem",
  "title": "A Polynomial-Time $O(\\sqrt n)$-Approximation for Undirected Three-Terminal Reachability-Preserving Minimum Edge Cut"
}