164
click to vote
APPROX
15 years 10 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...
170
click to vote
APPROX
15 years 10 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...
237
click to vote
APPROX
15 years 10 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...
133
click to vote
APPROX
15 years 10 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...
|
Algorithms