Sciweavers

3874 search results - page 95 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ICALP
2009
Springer
15 years 10 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
SIAMCO
2002
71views more  SIAMCO 2002»
14 years 9 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
IPL
2008
135views more  IPL 2008»
14 years 10 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
MOC
2000
86views more  MOC 2000»
14 years 9 months ago
Numerical algorithms for semilinear parabolic equations with small parameter based on approximation of stochastic equations
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...
G. N. Milstein, M. V. Tretyakov
EVOW
2006
Springer
15 years 1 months ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...