Logan Grout

According to our database, Logan Grout authored at least 8 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur

Algorithmica, August, 2024

2023

On a partition LP relaxation for min-cost 2-node connected spanning subgraphs.

Logan Grout, Joseph Cheriyan, Bundit Laekhanukit

Oper. Res. Lett., May, 2023

Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals.

Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur

Proceedings of the Approximation, 2023

2022

A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang

SIAM J. Discret. Math., September, 2022

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

Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur

CoRR, 2022

Approximating (p, 2) flexible graph connectivity via the primal-dual method.

Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur

CoRR, 2022

2020

The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true.

Logan Grout, Benjamin R. Moore

J. Comb. Theory B, 2020

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

Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang

Proceedings of the Approximation, 2020