Improved Algorithms for MST and Metric-TSP Interdiction
From MaRDI portal
Publication:5111362
DOI10.4230/LIPIcs.ICALP.2017.32zbMath1441.68290arXiv1706.00034OpenAlexW2963443829MaRDI QIDQ5111362
Chaitanya Swamy, André Linhares
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1706.00034
supermodular functionsapproximation algorithmsiterative roundinginterdiction problemsLP-rounding algorithmstree-knapsack problem
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (4)
Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Vertex downgrading to minimize connectivity ⋮ Parametric matroid interdiction ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs
This page was built for publication: Improved Algorithms for MST and Metric-TSP Interdiction