{"paper":{"title":"Solving group Steiner problems as Steiner problems: the rigorous proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Yahui Sun","submitted_at":"2018-11-29T07:23:44Z","abstract_excerpt":"The Steiner tree problems are well-known NP-hard problems that have diverse applications. Duin et al. (2004) have intuitively proposed the widely-used transformation from the classical group Steiner tree problem to the classical Steiner tree problem in graphs. This transformation has not been rigorously proven so far. Specifically, the large M value that is used in this transformation has not been specified. In this paper, we address this issue by rigorously prove this transformation for a specific large M value."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01678","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"}