676 search results - page 29 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
102
Voted
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
JPDC
2008
14 years 11 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
94
Voted
JCS
2011
14 years 6 months ago
2011
We present a model of adaptive attacks which we combine with information-theoretic metrics to quantify the information revealed to an adaptive adversary. This enables us to expres...
191
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
116
click to vote
COCO
1993
Springer
15 years 3 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...