Sharat Ibrahimpur

activity

20172026

most citedA

4/3

-Approximation Algorithm for the Minimum

2

-Edge Connected Multisubgraph Problem in the Half-Integral Case

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

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020

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…

cs.DS2020★ 2 cited

A $4/3$ -Approximation Algorithm for the Minimum $2$ -Edge Connected Multisubgraph Problem in the Half-Integral Case

S. Boyd, J. Cheriyan, R. Cummings +4

Given a connected undirected graph $G ˉ$ on $n$ vertices, and non-negative edge costs $c$ , the 2ECM problem is that of finding a $2$ -edge~connected spanning multisubgraph of $\…

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case

A $4/3$ -Approximation Algorithm for the Minimum $2$ -Edge Connected Multisubgraph Problem in the Half-Integral Case