APPROX
15 years 2 months ago
2005 Springer 
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
APPROX
15 years 2 months ago
2005 Springer 
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
APPROX
15 years 2 months ago
2005 Springer 
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
APPROX
15 years 2 months ago
2005 Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
APPROX
15 years 2 months ago
2005 Springer |
Algorithms