549 search results - page 32 / 110 » On the Complexity of Restricted k-anonymity Problem |
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
JUCS
2010
14 years 8 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
WSC
1998
14 years 11 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...