7150 search results - page 443 / 1430 » An Approximation Algorithm for Approximation Rank |
177
click to vote
IPL
2008
15 years 6 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
216
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
217
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
182
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
212
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...