Probability theory of classical Euclidean optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176071
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
- Limit theorems and rates of convergence for Euclidean functionals
Cited in
(88)- Concentration inequalities for random fields via coupling
- Limit theorems for random spatial drainage networks
- Central limit theorem for Euclidean minimal spanning acycles
- Minimum spanning trees of random geometric graphs with location dependent weights
- Design of computer experiments: space filling and beyond
- On the total length of the random minimal directed spanning tree
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
- A simple Fourier analytic proof of the AKT optimal matching theorem
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Intrinsic dimension identification via graph-theoretic methods
- Nearest-neighbor graphs on the cantor set
- Asymptotics for Euclidean functionals of mixing processes
- Euclidean travelling salesman problem with location-dependent and power-weighted edges
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Random parking, Euclidean functionals, and rubber elasticity
- Rates of multivariate normal approximation for statistics in geometric probability
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
- Limit theorems in discrete stochastic geometry
- A PDE approach to a 2-dimensional matching problem
- Correction: A class of Rényi information estimators for multidimensional densities
- A fractal dimension for measures via persistent homology
- Random geometric complexes in the thermodynamic regime
- A quadratic version of the traveling salesman problem
- Rate of convergence of power-weighted Euclidean minimal spanning trees
- Explicit laws of large numbers for random nearest-neighbour-type graphs
- Weak laws of large numbers in geometric probability
- Note on the structure of Kruskal's algorithm
- Asymptotic of power-weighted Euclidean functionals
- A new method of normal approximation
- Multivariate spatial central limit theorems with applications to percolation and spatial graphs
- Random minimal directed spanning trees and Dickman-type distributions
- Vertex ordering and partitioning problems for random spatial graphs.
- Randomized near-neighbor graphs, giant components and applications in data science
- Optimal flow through the disordered lattice
- Coulomb gases under constraint: some theoretical and numerical results
- Rooted edges of a minimal directed spanning tree on random points
- Convergence of asymptotic costs for random Euclidean matching problems
- Probabilistic properties of highly connected random geometric graphs
- A fluctuation result for the displacement in the optimal matching problem
- Asymptotic properties of combinatorial optimization problems in \(p\)-adic space
- On optimal matching of Gaussian samples
- On the choice of weight functions for linear representations of persistence diagrams
- Near-minimal spanning trees: A scaling exponent in probability models
- k-variance: a clustered notion of variance
- Gaussian limits for random measures in geometric probability
- On the quadratic random matching problem in two-dimensional domains
- Limit theory of combinatorial optimization for random geometric graphs
- Limit theory for the random on‐line nearest‐neighbor graph
- Asymptotics for the length of a minimal triangulation on a random sample
- Combinatorial Optimization Over Two Random Point Sets
- Some results on the optimal matching problem for the Jacobi model
- The radial spanning tree of a Poisson point process
- The saga of minimum spanning trees
- Short-length routes in low-cost networks via Poisson line patterns
- Covering algorithms, continuum percolation and the geometry of wireless networks
- Asymptotics for Voronoi tessellations on random samples
- Geodesics and flows in a Poissonian city
- Normal approximation for statistics of randomly weighted complexes
- The stretch-length tradeoff in geometric networks: average case and worst case study
- Local angles and dimension estimation from data on manifolds
- Connected spatial networks over random points and a route-length statistic
- On minimum spanning trees for random Euclidean bipartite graphs
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- Probabilistic analysis for a multiple depot vehicle routing problem
- Sub-tree counts on hyperbolic random geometric graphs
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
- Macroscopic and edge behavior of a planar jellium
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Asymptotics for weighted minimal spanning trees on random points
- On the largest common subtree of random leaf-labeled binary trees
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- A simple measure of conditional dependence
- Circular law for random matrices with unconditional log-concave distribution
- Quantitative two-scale stabilization on the Poisson space
- Rates of convergence of means of Euclidean functionals
- One-dimensional empirical measures, order statistics, and Kantorovich transport distances
- On the greedy walk problem
- scientific article; zbMATH DE number 176071 (Why is no real title available?)
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
- Optimal Matching of Random Samples and Rates of Convergence of Empirical Measures
- Smoothed analysis of the 2-opt heuristic for the TSP under Gaussian noise
- The scaling limits of the minimal spanning tree and invasion percolation in the plane
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees
- Limit theory for point processes in manifolds
- Central limit theorems for the radial spanning tree
- Upper large deviations for power-weighted edge lengths in spatial random networks
- On the variance of the random sphere of influence graph
- Distribution-sensitive construction of the greedy spanner
This page was built for publication: Probability theory of classical Euclidean optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385435)
