{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreigyy5rysinrtj33z37p2akhbximowlg2d4s647ffzzori6epacatu",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mk57zynlslk2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.20786v1",
  "publishedAt": "2026-04-23T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Leon Kellerhals",
    "Mitja Krebs",
    "André Nichterlein",
    "Stefan Schmid"
  ],
  "textContent": "**Authors:** Leon Kellerhals, Mitja Krebs, André Nichterlein, Stefan Schmid\n\nWe study the following problem that is motivated by demand-aware network design: Given a tree~$G$, the task is to find a binary tree~$H$ on the same vertex set. The objective is to minimize the sum of distances in~$H$ between vertex pairs that are adjacent in~$G$. We present a linear-time factor-4 approximation for this problem.",
  "title": "Designing Approximate Binary Trees for Trees"
}