12519 search results - page 159 / 2504 » Approximation Problems Categories |
170
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
223
click to vote
FOCS
2002
IEEE
16 years 7 days 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...
187
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
185
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
208
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...