论文标题
凸形序列的包装和覆盖特性
Packing and covering properties of sequences of convex bodies
论文作者
论文摘要
本文涉及以下问题的不同变体：给定凸集成$ k $和$ e^n $中凸面的序列$ \ {c_i \} $，是否有可能将尸体包装在$ k $中或覆盖$ k $的身体？这些问题的算法版本是在线填料和在线覆盖：序列的身体一次给出一个，并且算法是在揭示下一个身体之前决定到达身体的放置；放置后，身体将无法移动。
This paper suveys different variants of the following problem: Given a convex set $K$ and a sequence $\{C_i\}$ of convex bodies in $E^n$, is it possible to pack the sequence of bodies in $K$ or cover $K$ with the bodies? Algorithmic versions of these problems are on-line packing and on-line covering: The bodies of the sequence are given one at a time and the algorithm is to decide on the placement of the arriving body before the next body is revealed; once placed, the body cannot be moved.
