676 search results - page 66 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
191
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
179
click to vote
JMLR
2006
15 years 6 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
165
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
147
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 ...
135
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...