4894 search results - page 98 / 979 » The Guarding Problem - Complexity and Approximation |
169
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
149
click to vote
CRYPTO
2009
Springer
16 years 25 days 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...
179
click to vote
FOCS
2002
IEEE
15 years 11 months 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...
158
click to vote
COMPGEOM
2009
ACM
16 years 24 days 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...
145
click to vote
RE
2004
Springer
15 years 11 months ago
2004
Springer
When buying COTS-based software, the customer has to choose between what is available. The supplier may add some minor parts, but rarely everything the customer wants. This means t...