4894 search results - page 96 / 979 » The Guarding Problem - Complexity and Approximation |
135
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
160
click to vote
JCSS
2010
15 years 4 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
253
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
147
click to vote
WADS
2007
Springer
16 years 11 days ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
176
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...