{"paper":{"title":"Improved Algorithms for MST and Metric-TSP Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Linhares, Chaitanya Swamy","submitted_at":"2017-05-31T18:13:16Z","abstract_excerpt":"We consider the {\\em MST-interdiction} problem: given a multigraph $G = (V, E)$, edge weights $\\{w_e\\geq 0\\}_{e \\in E}$, interdiction costs $\\{c_e\\geq 0\\}_{e \\in E}$, and an interdiction budget $B\\geq 0$, the goal is to remove a set $R\\subseteq E$ of edges of total interdiction cost at most $B$ so as to maximize the $w$-weight of an MST of $G-R:=(V,E\\setminus R)$.\n  Our main result is a $4$-approximation algorithm for this problem. This improves upon the previous-best $14$-approximation~\\cite{Zenklusen15}. Notably, our analysis is also significantly simpler and cleaner than the one in~\\cite{Ze"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00034","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"}