1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2009★ 1 cited
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
Wenliang Du, David Eppstein, Michael T. Goodrich +1
We study the problem of abstracting a table of data about individuals so that no selection query can identify fewer than k individuals. We show that it is impossible to achieve arb…
cs.DS2001
The Minimum Expectation Selection Problem
David Eppstein, George Lueker
We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to mi…