Logan Grout

activity

20192022

most citedOn Decomposing Graphs Into Forests and Pseudoforests

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

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Extensions of the $(p, q)$ -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 $(p, q)$ -FGC model. Adjiashvili, Hommelsheim and Mühlenthaler introduced the model of F…

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

Extensions of the (p,q)-Flexible-Graph-Connectivity model

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

Extensions of the $(p, q)$ -Flexible-Graph-Connectivity model

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