2 citations · 2 across the 4 of their papers we have counts for
6 papers
Extensions of the -Flexible-Graph-Connectivity model
Ishan Bansal, Joseph Cheriyan, Logan Grout +1
We present approximation algorithms for network design problems in some models related to the -FGC model. Adjiashvili, Hommelsheim and Mühlenthaler introduced the model of F…
Approximation Algorithms for Flexible Graph Connectivity
Sylvia Boyd, Joseph Cheriyan, Arash Haddadan +1
We present approximation algorithms for several network design problems in the model of Flexible Graph Connectivity (Adjiashvili, Hommelsheim and Mühlenthaler, "Flexible Graph Conn…
A -Approximation Algorithm for Flexible Graph Connectivity
Sylvia Boyd, Joseph Cheriyan, Arash Haddadan +1
We present a -approximation algorithm for the Flexible Graph Connectivity problem [AHM20] via a reduction to the minimum cost -out -arborescence problem.
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
Sharat Ibrahimpur, Chaitanya Swamy
Motivated by the need for, and growing interest in, modeling uncertainty in data, we introduce and study {\em stochastic minimum-norm optimization}. We have an underlying combinato…
A -Approximation Algorithm for the Minimum -Edge Connected Multisubgraph Problem in the Half-Integral Case
S. Boyd, J. Cheriyan, R. Cummings +4
Given a connected undirected graph on vertices, and non-negative edge costs , the 2ECM problem is that of finding a -edge~connected spanning multisubgraph of $\…
Min-Max Theorems for Packing and Covering Odd -trails
Sharat Ibrahimpur, Chaitanya Swamy
We investigate the problem of packing and covering odd -trails in a graph. A -trail is a -walk that is allowed to have repeated vertices but no repeated edges.…