2652 search results - page 65 / 531 » Privacy-preserving linear programming |
139
click to vote
AAIM
2007
Springer
16 years 5 days ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
207
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...