{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZCBGLJHLV4NMYXVS6FW5NMIUT7","short_pith_number":"pith:ZCBGLJHL","schema_version":"1.0","canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","source":{"kind":"arxiv","id":"1706.00034","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.00034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T18:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"1ccd0be0c40aabf1d377908b0a8aa18c43403ad2967d676a51812a4286c82e38","abstract_canon_sha256":"4518f604e5bbcbe3e3015b4bd7f3b80e21315bf651c6238ed7ab4d9025414ca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.285933Z","signature_b64":"xPhwZGAVc4HDrIlcMpgiLmga7bLFudMCULYSw25NjCsy+jRLE9QVUodatLr4ZSIDTCqn+b/WJf1SqzbAx6qCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","last_reissued_at":"2026-05-18T00:43:15.285301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.285301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.00034","created_at":"2026-05-18T00:43:15.285388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00034v1","created_at":"2026-05-18T00:43:15.285388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00034","created_at":"2026-05-18T00:43:15.285388+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCBGLJHLV4NM","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCBGLJHLV4NMYXVS","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCBGLJHL","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7","json":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7.json","graph_json":"https://pith.science/api/pith-number/ZCBGLJHLV4NMYXVS6FW5NMIUT7/graph.json","events_json":"https://pith.science/api/pith-number/ZCBGLJHLV4NMYXVS6FW5NMIUT7/events.json","paper":"https://pith.science/paper/ZCBGLJHL"},"agent_actions":{"view_html":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7","download_json":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7.json","view_paper":"https://pith.science/paper/ZCBGLJHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00034&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCBGLJHLV4NMYXVS6FW5NMIUT7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCBGLJHLV4NMYXVS6FW5NMIUT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/action/storage_attestation","attest_author":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/action/author_attestation","sign_citation":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/action/citation_signature","submit_replication":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/action/replication_record"}},"created_at":"2026-05-18T00:43:15.285388+00:00","updated_at":"2026-05-18T00:43:15.285388+00:00"}