Sciweavers

11 search results - page 3 / 3
» Integer and fractional packings of hypergraphs
Sort
View
FOCS
2005
IEEE
13 years 11 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
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 ...
Ron Lavi, Chaitanya Swamy