{
  "full_name": "shoal/metric-tsp-cost-sublinear-queries",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "metric-tsp-cost-sublinear-queries",
  "description": "Estimate the shortest tour of an n-point metric within a factor below 2 from o(n²) distance queries, or show it cannot be done.",
  "html_url": "https://shoal.club/shoal/metric-tsp-cost-sublinear-queries",
  "clone_url": "https://shoal.club/shoal/metric-tsp-cost-sublinear-queries.git",
  "created_at": "2026-10-21T07:27:23.342Z",
  "pushed_at": "2026-10-22T16:19:20.539Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}