Add to ORKGA lower bound for the length of the shortest path through n points in [0, Ild is given in terms of the discrepancy function of the n points. This bound is applied to obtain an analogue for several pseudorandom sequences to the known limit behavior of the length of the shortest path through n independent uniformly distributed random observations from [0, l]d
AbstractWe investigate measures of pseudorandomness of finite sequences (xn) of real numbers. Maudui...
We present two complementary analytical approaches for calculating the distribution of shortest path...
We show that the pivoting process associated with one line and n points in r-dimensional space may n...
A lower bound for the length of the shortest path through n points in [0, Ild is given in terms of t...
International audienceWe prove consistency of four different approaches to formalizing the idea of m...
We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set c...
We present a general technique for obtaining bounds on the deviation of the optimal value of some st...
Let (M, g1) be a compact d-dimensional Riemannian manifold for d> 1. Let Xn be a set of n sample ...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
International audienceThe paper studies the expectation of the inspection time in complex aging syst...
The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visi...
A limit theorem is established for a class of random processes (called here subadditive Euclidean fu...
Let G = (V, E) be an (n, d, lambda)-graph. In this paper, we give an asymptotically tight condition ...
The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...
AbstractWe investigate measures of pseudorandomness of finite sequences (xn) of real numbers. Maudui...
We present two complementary analytical approaches for calculating the distribution of shortest path...
We show that the pivoting process associated with one line and n points in r-dimensional space may n...
A lower bound for the length of the shortest path through n points in [0, Ild is given in terms of t...
International audienceWe prove consistency of four different approaches to formalizing the idea of m...
We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set c...
We present a general technique for obtaining bounds on the deviation of the optimal value of some st...
Let (M, g1) be a compact d-dimensional Riemannian manifold for d> 1. Let Xn be a set of n sample ...
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidea...
International audienceThe paper studies the expectation of the inspection time in complex aging syst...
The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visi...
A limit theorem is established for a class of random processes (called here subadditive Euclidean fu...
Let G = (V, E) be an (n, d, lambda)-graph. In this paper, we give an asymptotically tight condition ...
The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences...
AbstractWe consider the problem of finding the shortest distance between all pairs of vertices in a ...
AbstractWe investigate measures of pseudorandomness of finite sequences (xn) of real numbers. Maudui...
We present two complementary analytical approaches for calculating the distribution of shortest path...
We show that the pivoting process associated with one line and n points in r-dimensional space may n...