{"paper":{"title":"A simple approximation algorithm for the internal Steiner minimum tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2013-07-15T05:56:54Z","abstract_excerpt":"For a metric graph $G=(V,E)$ and $R\\subset V$, the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning $R$ such that every vertex in $R$ is not a leaf. This note shows a simple polynomial-time $2\\rho$-approximation algorithm, in which $\\rho$ is the approximation ratio for the Steiner minimum tree problem. The result improves the previous best approximation ratio $2\\rho+1$ for the problem. The ratio is not currently best but the algorithm is very simple."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3822","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}