{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreih3ldeqmbgbrc2fuzstvciocfxcs2ku6uxdkxb5ni32rjlaglafxy",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mlcoh5fdfjn2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2605.04715v1",
  "publishedAt": "2026-05-07T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Michael T. M. Emmerich",
    "Ksenia Pereverdieva",
    "André Deutz"
  ],
  "textContent": "**Authors:** Michael T. M. Emmerich, Ksenia Pereverdieva, André Deutz\n\nWe study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k",
  "title": "On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces"
}