{"paper":{"title":"Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2014-07-04T09:36:32Z","abstract_excerpt":"Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \\emph{red} edges and a set $B$ of \\emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \\emph{Stackelberg Minimum Spanning Tree} (\\stack) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. \\stack \\ is known to be \\apx-hard already when the number of distinct red weights is 2. In this paper we analyze some meaningful specializations and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1167","kind":"arxiv","version":1},"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"}