1040 search results - page 43 / 208 » Rounding algorithms for covering problems |
WEA
2005
Springer
15 years 3 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
AAAI
2008
15 years 1 days ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
NIPS
2007
14 years 11 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...