Login / Signup
Logan Grout
Publication Activity (10 Years)
Years Active: 2020-2024
Publications (10 Years): 12
Top Topics
Min Cut
Approximation Algorithms
Lp Relaxation
Steiner Tree
Top Venues
CoRR
Oper. Res. Lett.
APPROX-RANDOM
APPROX/RANDOM
</>
Publications
</>
Ishan Bansal
,
Joseph Cheriyan
,
Logan Grout
,
Sharat Ibrahimpur
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions.
Algorithmica
86 (8) (2024)
Ishan Bansal
,
Joe Cheriyan
,
Logan Grout
,
Sharat Ibrahimpur
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals.
APPROX/RANDOM
(2023)
Logan Grout
,
Joseph Cheriyan
,
Bundit Laekhanukit
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs.
Oper. Res. Lett.
51 (3) (2023)
Ishan Bansal
,
Joseph Cheriyan
,
Logan Grout
,
Sharat Ibrahimpur
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions.
ICALP
(2023)
Ishan Bansal
,
Joe Cheriyan
,
Logan Grout
,
Sharat Ibrahimpur
Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals.
CoRR
(2022)
Ishan Bansal
,
Joseph Cheriyan
,
Logan Grout
,
Sharat Ibrahimpur
Approximating (p, 2) flexible graph connectivity via the primal-dual method.
CoRR
(2022)
Sylvia C. Boyd
,
Joseph Cheriyan
,
Robert Cummings
,
Logan Grout
,
Sharat Ibrahimpur
,
Zoltán Szigeti
,
Lu Wang
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.
SIAM J. Discret. Math.
36 (3) (2022)
Ishan Bansal
,
Joseph Cheriyan
,
Logan Grout
,
Sharat Ibrahimpur
Extensions of the (p, q)-Flexible-Graph-Connectivity model.
CoRR
(2022)
Logan Grout
,
Joseph Cheriyan
,
Bundit Laekhanukit
On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs.
CoRR
(2021)
Sylvia C. Boyd
,
Joseph Cheriyan
,
Robert Cummings
,
Logan Grout
,
Sharat Ibrahimpur
,
Zoltán Szigeti
,
Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.
CoRR
(2020)
Logan Grout
,
Benjamin Moore
The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true.
J. Comb. Theory, Ser. B
145 (2020)
Sylvia C. Boyd
,
Joseph Cheriyan
,
Robert Cummings
,
Logan Grout
,
Sharat Ibrahimpur
,
Zoltán Szigeti
,
Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.
APPROX-RANDOM
(2020)