• Aucun résultat trouvé

Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant

N/A
N/A
Protected

Academic year: 2021

Partager "Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant"

Copied!
23
0
0

Texte intégral

Loading

Références

Documents relatifs

Such strategies are: In general if two edges e 1 and e 2 generate the same increment on the number of models of A Σ e 1 is preferred over e 2 if e 1 could bring about a change of

so that defines an affine foliation for all admissible a 1. 1), such affine minimal folia- tions are stable under small perturbations of the integrand F if the

We study the intrinsic regularity of the sample paths of certain Brownian motions on the infinite dimensional torus T ∞.. Here, intrinsic regularity means regularity with respect to

In [26, Proposition 4.1.1], we also used signed measures in order to approximate mod-φ convergent random variables, but with respect to a continuous infinitely divisible distribution

We prove a quantitative equidistribution result for linear random walks on the torus, similar to a theorem of Bourgain, Furman, Lindenstrauss and Mozes, but without any

Instead, we are going to see that this result can also be obtained as a corollary of the one of BFLM for the linear walk : at first, we are going to prove that their result

In a polyhedron a generalized diagonal of direction ω between two edges is the union of all the billiards trajectory of direction ω between two points of these edges.. We say it is

The survey focuses on the commonly used strategies for modeling multi-dimensional data according to the Cube, because they affect how data can be found and consumed automatically.