{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreidnivftjc7ewyeulzw3sm6d6ahk5dsmcp4rw3kr7uvbermnf7cbxa",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mpleerhj6f62"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2606.31369v1",
  "publishedAt": "2026-07-01T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Maël Dumas"
  ],
  "textContent": "**Authors:** Maël Dumas\n\nWe give a constant-factor approximation algorithm for Max Dist-2 Independent Set in graphs of bounded radius-2 merge-width. The same result holds for Min Dominating Set from [Bonamy and Geniet, 2025], [Chan et al., SODA '12]. Both approximation algorithms are LP-based, showing that the domination-to-2-independence ratio is bounded in graphs of bounded radius-2 merge-width. Moreover, this result is tight in the sense that the ratio can be unbounded in graphs of bounded radius-1 merge-width.",
  "title": "Constant-factor approximation of maximum distance-2 independent set in graphs of bounded merge-width"
}