Random restricted matching and lower bounds for combinatorial optimization
From MaRDI portal
Publication:1928532
DOI10.1007/s10878-011-9384-4zbMath1282.90156OpenAlexW2154146365MaRDI QIDQ1928532
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9384-4
traveling salesmanuniform distributionminimal spanning treepacking problemsrestricted matchingVoronoi decomposition
Related Items (1)
Cites Work
- Sequences, discrepancies and applications
- A new lower bound for the geometric traveling salesman problem in terms of discrepancy
- On optimal matchings
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Discrepancy and distance between sets
- The transportation cost from the uniform measure to the empirical measure in dimension \(\geq 3\)
- Extremal uniform distribution and random chord lengths
- Box integrals
- Advances in the theory of box integrals
- Shortest Paths Through Pseudo-Random Points in the d-Cube
- Concerning $\int_0^1 \cdots \int_0^1 {(x_1^2 + \cdots + x_k^2 )} ^{{1 / 2}} dx_1 \cdots ,dx_k $ and a Taylor Series Method
- A First Course in Order Statistics
- On irregularities of distribution
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Random restricted matching and lower bounds for combinatorial optimization
