New results on tripod packings

DOI10.1007/S00454-018-0012-2zbMath1407.52019OpenAlexW2809442271MaRDI QIDQ1715997

Patric R. J. Östergård, Antti Pöllänen

Publication date: 29 January 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/33458

zbMATH Keywords

packingcliquetripodsemicrossmonotonic matrixStein corner

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (1)

Tripod Packings

Uses Software

• Cliquer

Cites Work

• Classification algorithms for codes and designs
• A fast algorithm for the maximum clique problem
• Packing tripods: narrowing the density gap
• Factoring by subsets
• Packings of<tex>R^n</tex>by certain error spheres
• Combinatorial packings of<tex>R^3</tex>by certain error spheres
• Codes Correcting Single Errors of Limited Magnitude
• A general formulation of error matrices (Corresp.)
• Unnamed Item
• Unnamed Item

This page was built for publication: New results on tripod packings