207 search results - page 30 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
114
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
105
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
129
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
128
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
147
Voted
ALGORITHMICA
2011
14 years 10 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...