research
∙
11/01/2022
On the zeroes of hypergraph independence polynomials
We study the locations of complex zeroes of independence polynomials of ...
share
research
∙
08/08/2022
Multi Purpose Routing: New Perspectives and Approximation Algorithms
The cost due to delay in services may be intrinsically different for var...
research
∙
07/09/2022
Determinant Maximization via Matroid Intersection Algorithms
Determinant maximization problem gives a general framework that models p...
research
∙
08/02/2021
Hardness and Approximation of Submodular Minimum Linear Ordering Problems
The minimum linear ordering problem (MLOP) seeks to minimize an aggregat...
research
∙
07/22/2021
The Traveling Firefighter Problem
We introduce the L_p Traveling Salesman Problem (L_p-TSP), given by an o...
research
∙
08/13/2020
On the Bipartiteness Constant and Expansion of Cayley Graphs
Let G be a finite, undirected d-regular graph and A(G) its normalized ad...
research
∙
07/17/2020
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
We study the generalized min sum set cover (GMSSC) problem, wherein give...
research
∙
03/12/2020
On the Complexity of λ_∞ , Vertex Expansion, and Spread Constant of Trees
Bobkov, Houdré, and the last author introduced a Poincaré-type functiona...
research
∙
09/20/2019
Efficient sampling and counting algorithms for the Potts model on Z^d at all temperatures
For d > 2 and all q≥ q_0(d) we give an efficient algorithm to approximat...
research
∙
09/18/2018