7 citations · 29 across the 31 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 7 cited
The Cutting Plane Method is Polynomial for Perfect Matchings
Karthekeyan Chandrasekaran, Laszlo A. Vegh, Santosh Vempala
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plumme…
cs.DS2012★ 5 cited
Finding a most biased coin with fewest flips
Karthekeyan Chandrasekaran, Richard Karp
We study the problem of learning a most biased coin among a set of coins by tossing the coins adaptively. The goal is to minimize the number of tosses until we identify a coin i* w…