1 citations · 1 across the 3 of their papers we have counts for
3 papers
Algorithms for Implicit Hitting Set Problems
Karthekeyan Chandrasekaran, Richard Karp, Erick Moreno-Centeno +1
A hitting set for a collection of sets is a set that has a non-empty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum cardi…
The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions
Karthekeyan Chandrasekaran, Amit Deshpande, Santosh Vempala
Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to…
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a give…