796 search results - page 6 / 160 » Approximating the centroid is hard |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
104
click to vote
CSR
2007
Springer
15 years 3 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...