On-line algorithms for the q-adic covering of the unit interval and for covering a cube by cubes

zbMATH Open1020.52017MaRDI QIDQ1856599FDOQ1856599

Authors: Marek Lassak 

Publication date: 10 February 2003

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228479

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes
• scientific article; zbMATH DE number 720248
• scientific article; zbMATH DE number 2065240
• On-line covering the unit cube by cubes
• On-line covering a cube by a sequence of cubes

zbMATH Keywords

on-line covering\(q\)-adic coveringsequence of cubessequence of segments

Mathematics Subject Classification ID

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

Cited In (3)

• Efficient on-line algorithm for maintaining \(k\)-cover of sparse bit-strings
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On-line algorithms for the \(q\)-adic covering of the unit interval and for covering a cube by cubes

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