On hypercube packings, blocking sets and a covering problem
From MaRDI portal
Publication:477608
DOI10.1016/J.IPL.2014.08.005zbMATH Open1302.68275OpenAlexW2076727989MaRDI QIDQ477608FDOQ477608
Authors: K. Ashik Mathew, Patric R. J. Östergård 
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.08.005
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)
Cites Work
- A user's guide to tabu search
- Practical graph isomorphism. II.
- On the Shannon capacity of a graph
- Classification algorithms for codes and designs
- Relations between packing and covering numbers of a tree
- Football Pools--A Game for Mathematicians
- Isomorph-Free Exhaustive Generation
- Keller’s cube-tiling conjecture is false in high dimensions
- Cube tilings as contributions of algebra to geometry
- Random sequential packing of cubes
- Enumerating cube tilings
- Cube packings, second moment and holes
- A covering problem for tori
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- Title not available (Why is that?)
- Bounds on the domination number of Kneser graphs
Cited In (5)
Uses Software
This page was built for publication: On hypercube packings, blocking sets and a covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477608)
