{"paper":{"title":"A Parameterized Approximation Algorithm for The Shallow-Light Steiner Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kewen Liao, Longkun Guo","submitted_at":"2012-12-14T07:23:08Z","abstract_excerpt":"For a given graph $G=(V,\\, E)$ with a terminal set $S$ and a selected root $r\\in S$, a positive integer cost and a delay on every edge and a delay constraint $D\\in Z^{+}$, the shallow-light Steiner tree (\\emph{SLST}) problem is to compute a minimum cost tree spanning the terminals of $S$, in which the delay between root and every vertex is restrained by $D$. This problem is NP-hard and very hard to approximate. According to known inapproximability results, this problem admits no approximation with ratio better than factor $(1,\\, O(\\log^{2}n))$ unless $NP\\subseteq DTIME(n^{\\log\\log n})$ \\cite{k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3403","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"}