A matching problem and subadditive Euclidean functionals
From MaRDI portal
Publication:1308702
DOI10.1214/aoap/1177005364zbMath0784.60020OpenAlexW2026605536MaRDI QIDQ1308702
Publication date: 2 January 1994
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005364
Related Items
Generating subtour elimination constraints for the TSP from pure integer solutions, Asymptotics for weighted minimal spanning trees on random points, On the fluctuations of simple matching, Asymptotics for the Euclidean TSP with power weighted edges, Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars, Concentration of measure and isoperimetric inequalities in product spaces, Asymptotics for Euclidean functionals with power-weighted edges, A measure concentration inequality for contracting Markov chains, Optimal random matchings, tours, and spanning trees in hierarchically separated trees, Smoothed analysis of partitioning algorithms for Euclidean functionals, The radial spanning tree of a Poisson point process, Scaling laws for maximum coloring of random geometric graphs, Limit of the Transport Capacity of a Dense Wireless Network, Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem, Probabilistic properties of highly connected random geometric graphs, An average case analysis of the minimum spanning tree heuristic for the power assignment problem, Ergodic theorems for some classical problems in combinatorial optimization, Asymptotics for the length of a minimal triangulation on a random sample, Combinatorial Optimization Over Two Random Point Sets, Law of large numbers for a two-dimensional class cover problem
