630 search results - page 84 / 126 » Hardness results for approximating the bandwidth |
154
Voted
ESA
2009
Springer
16 years 22 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
193
Voted
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
169
Voted
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
163
Voted
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
145
Voted
CRYPTO
2006
Springer
15 years 9 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...