2698 search results - page 17 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
123
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
107
click to vote
IPL
2006
15 years 2 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...
108
click to vote
UAI
1994
15 years 4 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....
126
Voted
SODA
2010
ACM
16 years 1 days ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
137
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...