✦ LIBER ✦

On a Covering Problem in the Hypercube

✍ Scribed by Özkahya, Lale; Stanton, Brendon

Book ID: 121595238
Publisher: Springer Japan
Year: 2013
Tongue: English
Weight: 162 KB
Volume: 31
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-013-1379-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On hypercube packings, blocking sets and

On hypercube packings, blocking sets and a covering problem

✍ Ashik Mathew, K.; Östergård, Patric R.J. 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 219 KB

On a leverage problem in the hypercube

✍ Peter Hamburger; Raymond E. Pippert; W. Douglas Weakley 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

On a hypercube coloring problem

✍ Patric R.J. ÖstergÅrd 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 167 KB

An analysis of parallel routing algorith

An analysis of parallel routing algorithm on hypercube network by employing covering problem and assignment problem

✍ Chung, Ilyong 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 104 KB

New bounds on a hypercube coloring probl

New bounds on a hypercube coloring problem

✍ Hung Quang Ngo; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 57 KB

In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of χ k (n), the minimum number of

The steiner problem in the hypercube

✍ Zevi Miller; Manley Perkel 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 976 KB