The steiner problem in the hypercube

DOI10.1002/NET.3230220102MaRDI QIDQ3989541zbMATH OpenOpenAlexFDO

Authors Z. Miller, Manley Perkel

Publication date 28 June 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220102

zbMATH Keywords

Steiner problem for a undirected graphSteiner problem for undirected graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Near optimal bounds for Steiner trees in the hypercube
• Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube
• scientific article; zbMATH DE number 3871417
• scientific article; zbMATH DE number 3918122
• The Steiner problem with edge lengths 1 and 2

Cited in

(8)

• On the low-dimensional Steiner minimum tree problem in Hamming metric
• The Fermat-Steiner Problem
• Steiner connectivity problems in hypergraphs
• The Steiner distance problem for large vertex subsets in the hypercube
• Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube
• Near optimal bounds for Steiner trees in the hypercube
• Russian doll search for the Steiner triple covering problem
• Hyperovals in Steiner systems

This page was built for publication: The steiner problem in the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989541)