Probability theory of classical Euclidean optimization problems
From MaRDI portal
Publication:1385435
DOI10.1007/BFb0093472zbMath0902.60001OpenAlexW1489238841MaRDI QIDQ1385435
Publication date: 27 April 1998
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0093472
Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items (82)
Weak laws of large numbers in geometric probability ⋮ Generating subtour elimination constraints for the TSP from pure integer solutions ⋮ Asymptotics for weighted minimal spanning trees on random points ⋮ Asymptotics for Voronoi tessellations on random samples ⋮ The scaling limits of the minimal spanning tree and invasion percolation in the plane ⋮ Vertex ordering and partitioning problems for random spatial graphs. ⋮ Euclidean travelling salesman problem with location-dependent and power-weighted edges ⋮ Optimal flow through the disordered lattice ⋮ Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic ⋮ On the quadratic random matching problem in two-dimensional domains ⋮ THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS ⋮ A fluctuation result for the displacement in the optimal matching problem ⋮ Convergence of asymptotic costs for random Euclidean matching problems ⋮ Sub-tree counts on hyperbolic random geometric graphs ⋮ Note on the structure of Kruskal's algorithm ⋮ Concentration inequalities for random fields via coupling ⋮ Random parking, Euclidean functionals, and rubber elasticity ⋮ Limit Theorems in Discrete Stochastic Geometry ⋮ $k$-Variance: A Clustered Notion of Variance ⋮ On the greedy walk problem ⋮ Optimal random matchings, tours, and spanning trees in hierarchically separated trees ⋮ Limit theory for point processes in manifolds ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ Computing the variance of tour costs over the solution space of the TSP in polynomial time ⋮ Correction: A class of Rényi information estimators for multidimensional densities ⋮ Optimal Matching of Random Samples and Rates of Convergence of Empirical Measures ⋮ Rates of multivariate normal approximation for statistics in geometric probability ⋮ Upper large deviations for power-weighted edge lengths in spatial random networks ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Macroscopic and edge behavior of a planar jellium ⋮ Connected spatial networks over random points and a route-length statistic ⋮ Asymptotics for Euclidean functionals of mixing processes ⋮ A Fractal Dimension for Measures via Persistent Homology ⋮ Rate of convergence of power-weighted Euclidean minimal spanning trees ⋮ Smoothed analysis of partitioning algorithms for Euclidean functionals ⋮ Covering algorithms, continuum percolation and the geometry of wireless networks ⋮ Central limit theorems for the radial spanning tree ⋮ The saga of minimum spanning trees ⋮ Short-length routes in low-cost networks via Poisson line patterns ⋮ A PDE approach to a 2-dimensional matching problem ⋮ Randomized near-neighbor graphs, giant components and applications in data science ⋮ A new method of normal approximation ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ Minimum spanning trees of random geometric graphs with location dependent weights ⋮ The radial spanning tree of a Poisson point process ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs ⋮ Random geometric complexes in the thermodynamic regime ⋮ Rates of convergence of means of Euclidean functionals ⋮ Distribution-sensitive construction of the greedy spanner ⋮ Design of computer experiments: space filling and beyond ⋮ Asymptotic properties of combinatorial optimization problems in \(p\)-adic space ⋮ Random minimal directed spanning trees and Dickman-type distributions ⋮ Geodesics and flows in a Poissonian city ⋮ The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study ⋮ Explicit laws of large numbers for random nearest-neighbour-type graphs ⋮ Gaussian limits for random measures in geometric probability ⋮ On the variance of the random sphere of influence graph ⋮ Local angles and dimension estimation from data on manifolds ⋮ Limit theorems for random spatial drainage networks ⋮ A simple measure of conditional dependence ⋮ Near-minimal spanning trees: A scaling exponent in probability models ⋮ Limit theory for the random on‐line nearest‐neighbor graph ⋮ Some results on the optimal matching problem for the Jacobi model ⋮ Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem ⋮ Nearest-neighbor graphs on the cantor set ⋮ Probabilistic properties of highly connected random geometric graphs ⋮ Coulomb Gases Under Constraint: Some Theoretical and Numerical Results ⋮ Rooted edges of a minimal directed spanning tree on random points ⋮ On the total length of the random minimal directed spanning tree ⋮ On optimal matching of Gaussian samples ⋮ A simple Fourier analytic proof of the AKT optimal matching theorem ⋮ Limit theory of combinatorial optimization for random geometric graphs ⋮ On the choice of weight functions for linear representations of persistence diagrams ⋮ One-dimensional empirical measures, order statistics, and Kantorovich transport distances ⋮ Quantitative two-scale stabilization on the Poisson space ⋮ Probabilistic analysis for a multiple depot vehicle routing problem ⋮ Asymptotics for the length of a minimal triangulation on a random sample ⋮ Multivariate spatial central limit theorems with applications to percolation and spatial graphs ⋮ Asymptotic of power-weighted Euclidean functionals ⋮ Combinatorial Optimization Over Two Random Point Sets ⋮ Circular law for random matrices with unconditional log-concave distribution ⋮ On the Largest Common Subtree of Random Leaf-Labeled Binary Trees
This page was built for publication: Probability theory of classical Euclidean optimization problems
