J. Cheriyan

activity

20122024

most citedA

4/3

-Approximation Algorithm for the Minimum

2

-Edge Connected Multisubgraph Problem in the Half-Integral Case

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

collaborators

Showing 2020 · cs.DSShow all

2 papers · 2 filters

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 $\…

cs.DS2020

An Improved Approximation Algorithm for the Matching Augmentation Problem

J. Cheriyan, R. Cummings, J. Dippel +1

We present a $\frac{5}{3}$ -approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost ze…

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

An Improved Approximation Algorithm for the Matching Augmentation Problem

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