168 search results - page 21 / 34 » On Nontrivial Approximation of CSPs |
113
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
117
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
239
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
130
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
118
click to vote
PG
2007
IEEE
15 years 8 months ago
2007
IEEE
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...