1279 search results - page 32 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
DAGSTUHL
2007
13 years 10 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
ISAAC
2000
Springer
14 years 8 days ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
ALGORITHMICA
1998
13 years 8 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
APPROX
2011
Springer
12 years 8 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...