Subadditive Euclidean functionals and nonlinear growth in geometric probability
From MaRDI portal
Cited in
(57)- Reconstruction of polycrystalline structures: a new application of combinatorial optimization
- Two probabilistic results on rectilinear Steiner trees
- Almost subadditive multiparameter ergodic theorems
- An appraisal of computational complexity for operations researchers
- A primer of the Euclidean Steiner problem
- Euclidean semi-matchings of random samples
- Worst-case minimum rectilinear Steiner trees in all dimensions
- Asymptotics for the length of a minimal triangulation on a random sample
- Rate of convergence for the Euclidean minimum spanning tree limit law
- On the fluctuations of simple matching
- Asymptotics for transportation cost in high dimensions
- Worst case asymptotics for some classical optimization problems
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
- Continuous approximation models in freight distribution management
- Worst-case demand distributions in vehicle routing
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
- On the k-center problem with many centers
- Asymptotics for the Euclidean TSP with power weighted edges
- On properties of geometric random problems in the plane
- Asymptotics for Euclidean functionals with power-weighted edges
- Random restricted matching and lower bounds for combinatorial optimization
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Euclidean travelling salesman problem with location-dependent and power-weighted edges
- Traveling salesman problem across well-connected cities and with location-dependent edge lengths
- An improved lower bound for the traveling salesman constant
- Further results on the probabilistic traveling salesman problem
- Rates of convergence of means of Euclidean functionals
- Ergodic theorems for some classical problems in combinatorial optimization
- The invariance principle for the total length of the nearest-neighbor graph
- Dividing a territory among several vehicles
- Combinatorial Optimization Over Two Random Point Sets
- A survey on combinatorial optimization in dynamic environments
- Household-level economies of scale in transportation
- Randomized near-neighbor graphs, giant components and applications in data science
- A survey of heuristics for the weighted matching problem
- Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- Probabilistic Analysis of Geometric Location Problems
- Euclidean matching problems and the metropolis algorithm
- Heuristics for planar minimum‐weight perfect metchings
- Limit of the transport capacity of a dense wireless network
- Traveling in randomly embedded random graphs
- Law of large numbers for a two-dimensional class cover problem
- Average optimal cost for the Euclidean TSP in one dimension
- Scaling laws for maximum coloring of random geometric graphs
- New Bounds for the Traveling Salesman Constant
- Limit theorems in discrete stochastic geometry
- New policies for the dynamic traveling salesman problem
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
- Convergence rate for geometric statistics of point processes having fast decay of dependence
- Optimal transport methods for combinatorial optimization over two random point sets
- On minimum spanning trees for random Euclidean bipartite graphs
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
- A partitioning algorithm for minimum weighted Euclidean matching
- Partitioning heuristics for two geometric maximization problems
- A quantization framework for smoothed analysis of Euclidean optimization problems
- The physicist's approach to the travelling salesman problem. II
This page was built for publication: Subadditive Euclidean functionals and nonlinear growth in geometric probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152627)
