2 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions
Andre Linhares, Chaitanya Swamy
Two-stage stochastic optimization is a framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and de…
Approximate Multi-Matroid Intersection via Iterative Refinement
André Linhares, Neil Olver, Chaitanya Swamy +1
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matr…
Improved Algorithms for MST and Metric-TSP Interdiction
André Linhares, Chaitanya Swamy
We consider the {\em MST-interdiction} problem: given a multigraph , edge weights , interdiction costs , and an interd…
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
Andre Linhares, Chaitanya Swamy
We study the {\em min-cost chain-constrained spanning-tree} (abbreviated \mcst) problem: find a min-cost spanning tree in a graph subject to degree constraints on a nested family o…