AAAI
2010
13 years 11 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....
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...