4 papers
A -Approximation Analysis for the Cover Small Cuts Problem
Miles Simmons, Ishan Bansal, Joe Cheriyan
In the Cover Small Cuts problem, we are given a capacitated (undirected) graph and a threshold value , as well as a set of links with end-nodes in and a non-…
Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
Miles Simmons, Ishan Bansal, Joe Cheriyan
Diestel, et al. (see Order 35 (2017), JCT-A 167 (2019), arXiv:1805.01439) introduced the notion of abstract separation systems that satisfy a submodularity property, and they call…
A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
Miles Simmons, Ishan Bansal, Joe Cheriyan
Jain's iterative rounding theorem is a well-known result in the area of approximation algorithms and, more broadly, in combinatorial optimization. The theorem asserts that LP relax…
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…