4894 search results - page 10 / 979 » The Guarding Problem - Complexity and Approximation |
129
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
106
click to vote
SODA
2010
ACM
15 years 10 months 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...
101
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
129
click to vote
WDAG
2009
Springer
15 years 7 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
88
Voted
IPL
2006
15 years 24 days ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...