4377 search results - page 226 / 876 » Mass problems and randomness |
136
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
186
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
151
click to vote
ESA
2005
Springer
16 years 4 days ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signi...
166
click to vote
SAT
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
175
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...