{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreic77g3yli7e2cotqdjitomhhuws3mccdsmhkgdkwzdniczdlwfge4",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3me5xekxf5iz2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.05773v1",
  "publishedAt": "2026-02-06T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Yılmaz Arslanoğlu"
  ],
  "textContent": "**Authors:** Yılmaz Arslanoğlu\n\nWe present a brief structural equivalence between the symmetric TSP and a constrained Group Steiner Tree Problem (cGSTP) defined on a simplicial incidence graph. Given the complete weighted graph on the city set V, we form the bipartite incidence graph between triangles and edges. Selecting an admissible, disk-like set of triangles induces a unique boundary cycle. With global connectivity and local regularity constraints, maximizing net weight in the cGSTP is exactly equivalent to minimizing the TSP tour length.",
  "title": "A Structural Equivalence of Symmetric TSP to a Constrained Group Steiner Tree Problem"
}