536 search results - page 80 / 108 » The hardness and approximation algorithms for l-diversity |
144
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
199
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
163
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
173
click to vote
COMPGEOM
2009
ACM
16 years 21 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
162
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...