530 search results - page 21 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
TON
2010
13 years 2 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...