7 citations · 29 across the 31 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 1 cited
Integer Feasibility of Random Polytopes
Karthekeyan Chandrasekaran, Santosh Vempala
We study integer programming instances over polytopes P(A,b)={x:Ax<=b} where the constraint matrix A is random, i.e., its entries are i.i.d. Gaussian or, more generally, its rows a…
cs.DS2011
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…