107 search results - page 7 / 22 » Random sampling and approximation of MAX-CSP problems |
STOC
1995
ACM
13 years 11 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
SIGMETRICS
2011
ACM
12 years 10 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
ICALP
2010
Springer
14 years 10 days ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...