3 citations · 4 across the 10 of their papers we have counts for
11 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…
Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
Ishan Bansal, Joseph Cheriyan, Sanjeev Khanna +1
We present improved approximation algorithms for some problems in the related areas of Capacitated Network Design and Flexible Graph Connectivity. In the Cap--ECSS problem, we a…
A Global Analysis of the Primal-Dual Method for Pliable Families
Ishan Bansal
We study a core algorithmic problem in network design called -augmentation that involves increasing the connectivity of a given family of cuts . Over 30 years ago, Willia…
Warehouse Problem with Bounds, Fixed Costs and Complementarity Constraints
Ishan Bansal, Oktay Günlük
This paper studies an open question in the warehouse problem where a merchant trading a commodity tries to find an optimal inventory-trading policy to decide on purchase and sale q…
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 the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels
Manan Bhandari, Ishan Bansal, V. Lalitha
Polar codes, introduced by Arikan, achieve the capacity of arbitrary binary-input discrete memoryless channel under successive cancellation decoding. Any such channel having ca…
DeCoILFNet: Depth Concatenation and Inter-Layer Fusion based ConvNet Accelerator
Akanksha Baranwal, Ishan Bansal, Roopal Nahar +1
Convolutional Neural Networks (CNNs) are rapidly gaining popularity in varied fields. Due to their increasingly deep and computationally heavy structures, it is difficult to deploy…