J. Cheriyan

activity

20122024

most citedThe Matching Augmentation Problem: A

\frac{7}{4}

-Approximation Algorithm

12 citations · 30 across the 17 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.DS2021

On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs

Logan Grout, Joseph Cheriyan, Bundit Laekhanukit

Our motivation is to improve on the best approximation guarantee known for the problem of finding a minimum-cost 2-node connected spanning subgraph of a given undirected graph with…

math.CO2021★ 1 cited

Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs

Joseph Cheriyan, Sepehr Hajebi, Zishen Qu +1

In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw ( $K_{1, 3}$ ) or a net (a fixed six-vertex graph) as an induc…

cs.DS2021

A $2$ -Approximation Algorithm for Flexible Graph Connectivity

Sylvia Boyd, Joseph Cheriyan, Arash Haddadan +1

We present a $2$ -approximation algorithm for the Flexible Graph Connectivity problem [AHM20] via a reduction to the minimum cost $r$ -out $2$ -arborescence problem.

On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs

Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs

A 2-Approximation Algorithm for Flexible Graph Connectivity

A $2$ -Approximation Algorithm for Flexible Graph Connectivity