Subadditive Euclidean functionals and nonlinear growth in geometric probability
From MaRDI portal
Publication:1152627
DOI10.1214/aop/1176994411zbMath0461.60029OpenAlexW1993966762MaRDI QIDQ1152627
Publication date: 1981
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176994411
Geometric probability and stochastic geometry (60D05) Strong limit theorems (60F15) Combinatorial probability (60C05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items
Heuristics for planar minimum‐weight perfect metchings, Reconstruction of polycrystalline structures: a new application of combinatorial optimization, Further results on the probabilistic traveling salesman problem, Euclidean travelling salesman problem with location-dependent and power-weighted edges, On the fluctuations of simple matching, Asymptotics for transportation cost in high dimensions, Average optimal cost for the Euclidean TSP in one dimension, Asymptotics for the Euclidean TSP with power weighted edges, A survey on combinatorial optimization in dynamic environments, Euclidean matching problems and the metropolis algorithm, Two probabilistic results on rectilinear Steiner trees, Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars, On properties of geometric random problems in the plane, Almost subadditive multiparameter ergodic theorems, Asymptotics for Euclidean functionals with power-weighted edges, Worst case asymptotics for some classical optimization problems, Limit Theorems in Discrete Stochastic Geometry, Random restricted matching and lower bounds for combinatorial optimization, Probabilistic combinatorial optimization problems on graphs: A new domain in operational research, Continuous approximation models in freight distribution management, A quantization framework for smoothed analysis of Euclidean optimization problems, Household-Level Economies of Scale in Transportation, Convergence rate for geometric statistics of point processes having fast decay of dependence, Unnamed Item, Optimal transport methods for combinatorial optimization over two random point sets, Smoothed analysis of partitioning algorithms for Euclidean functionals, The physicist's approach to the travelling salesman problem. II, An appraisal of computational complexity for operations researchers, A primer of the Euclidean Steiner problem, Randomized near-neighbor graphs, giant components and applications in data science, Euclidean semi-matchings of random samples, Worst-case minimum rectilinear Steiner trees in all dimensions, Rates of convergence of means of Euclidean functionals, A survey of heuristics for the weighted matching problem, Scaling laws for maximum coloring of random geometric graphs, Worst-case demand distributions in vehicle routing, New policies for the dynamic traveling salesman problem, Limit of the Transport Capacity of a Dense Wireless Network, Traveling salesman problem across well-connected cities and with location-dependent edge lengths, Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem, An improved lower bound for the traveling salesman constant, Dividing a Territory Among Several Vehicles, An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability, The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees, On the k-center problem with many centers, Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching, Ergodic theorems for some classical problems in combinatorial optimization, New Bounds for the Traveling Salesman Constant, Asymptotics for the length of a minimal triangulation on a random sample, A partitioning algorithm for minimum weighted Euclidean matching, The invariance principle for the total length of the nearest-neighbor graph, Partitioning heuristics for two geometric maximization problems, Combinatorial Optimization Over Two Random Point Sets, Probabilistic Analysis of Geometric Location Problems, Rate of convergence for the Euclidean minimum spanning tree limit law, Law of large numbers for a two-dimensional class cover problem
