A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound
From MaRDI portal
Publication:5751655
DOI10.1137/0404005zbMath0719.60015OpenAlexW1886622508MaRDI QIDQ5751655
Peter W. Shor, Edward G. jun. Coffman
Publication date: 1991
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404005
Analysis of algorithms and problem complexity (68Q25) Geometric probability and stochastic geometry (60D05)
Related Items
On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis ⋮ Matching Theorems and Empirical Discrepancy Computations using Majorizing Measures ⋮ A simple Fourier analytic proof of the AKT optimal matching theorem
This page was built for publication: A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound
