369 search results - page 6 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
ISAAC
2001
Springer
13 years 11 months ago
2001
Springer
PODC
2009
ACM
14 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
IPL
2006
13 years 7 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
UAI
1994
13 years 8 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
SIAMCOMP
1998
13 years 6 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...