Minimal universal covers in \(E^ n\)
From MaRDI portal
Publication:2626052
DOI10.1007/BF02759701zbMath0117.39502MaRDI QIDQ2626052
Publication date: 1963
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items
A LOWER BOUND FOR LEBESGUE'S UNIVERSAL COVER PROBLEM, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Nonconvex cases for carpenter's rulers
Cites Work