2 citations · 4 across the 6 of their papers we have counts for
7 papers
Extensions of the -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 -FGC model. Adjiashvili, Hommelsheim and Mühlenthaler introduced the model of F…
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…
Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals
Ishan Bansal, Joe Cheriyan, Logan Grout +1
The -Steiner-2NCS problem is as follows: Given a constant , and an undirected connected graph , non-negative costs on , and a partition of in…
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…
A -Approximation Algorithm for the Minimum -Edge Connected Multisubgraph Problem in the Half-Integral Case
S. Boyd, J. Cheriyan, R. Cummings +4
Given a connected undirected graph on vertices, and non-negative edge costs , the 2ECM problem is that of finding a -edge~connected spanning multisubgraph of $\…
The Pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is True
Logan Grout, Benjamin Moore
We prove that for any positive integers and , if a graph has maximum average degree at most , then decomposes into pseudoforests $C_{1},…