On hypercube packings, blocking sets and a covering problem

DOI10.1016/j.ipl.2014.08.005zbMath1302.68275OpenAlexW2076727989MaRDI QIDQ477608

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

zbMATH Keywords

coveringcombinatorial problemscomputational geometryblocking setnon-extensible packing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

New results on torus cube packings and tilings

Uses Software

• nauty
• Traces
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating cube tilings
• Classification algorithms for codes and designs
• Cube packings, second moment and holes
• Relations between packing and covering numbers of a tree
• Cube tilings as contributions of algebra to geometry
• A covering problem for tori
• A user's guide to tabu search
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Practical graph isomorphism. II.
• Bounds on the domination number of Kneser graphs
• Keller’s cube-tiling conjecture is false in high dimensions
• On the Shannon capacity of a graph
• Isomorph-Free Exhaustive Generation
• Football Pools--A Game for Mathematicians

This page was built for publication: On hypercube packings, blocking sets and a covering problem