630 search results - page 38 / 126 » Hardness results for approximating the bandwidth |
93
Voted
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
94
Voted
AAAI
2010
15 years 2 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
123
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
149
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
CCCG
2010
15 years 2 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...