676 search results - page 6 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
116
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
DISOPT
2006
14 years 11 months ago
2006
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...