Work

The Steiner distance problem for large vertex subsets in the hypercube

Year: 2019

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1907.07546

Authors: Czabarka, Éva, Reiswig, Josiah, Székely, László

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: Extremal and Probabilistic Combinatorics with Applications

OpenAlex ID: W2961549616

Cites: 2

Cited by:

Related to: 20