The Steiner distance problem for large vertex subsets in the hypercube
Abstract
We find the asymptotic behavior of the Steiner k-diameter of the n-cube if k is large. Our main contribution is the lower bound, which utilizes the probabilistic method.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.