COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
COMPGEOM
2007
ACM
14 years 3 months ago
2007
ACM
CAAN
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
CAAN
2007
Springer
14 years 3 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
CAAN
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...