840 search results - page 10 / 168 » Inapproximability of Combinatorial Optimization Problems |
SBACPAD
2005
IEEE
14 years 3 months ago
2005
IEEE
EUSFLAT
2009
13 years 7 months ago
2009
ORL
2010
13 years 4 months ago
2010
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
ECCC
2010
13 years 10 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...