André Linhares

activity

20162026

most citedApproximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems

2 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing 2017Show all

1 paper · 1 filter

cs.DS2017★ 2 cited

Improved Algorithms for MST and Metric-TSP Interdiction

André Linhares, Chaitanya Swamy

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 interd…