Logan Grout

activity

20192022

most citedOn Decomposing Graphs Into Forests and Pseudoforests

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

collaborators

Showing 2022Show all

3 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.DS2022

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

Ishan Bansal, Joseph Cheriyan, Logan Grout +1

We address long-standing open questions raised by Williamson, Goemans, Vazirani and Mihail pertaining to the design of approximation algorithms for problems in network design via t…

cs.DS2022

Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals

Ishan Bansal, Joe Cheriyan, Logan Grout +1

The $k$ -Steiner-2NCS problem is as follows: Given a constant $k$ , and an undirected connected graph $G = (V, E)$ , non-negative costs $c$ on $E$ , and a partition $(T, V - T)$ of $V$ in…

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

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals

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