On-line packing and covering a disk with disks
Open AccessOriginal Paper
- 204 Downloads
A circular disk D of area |D| can be on-line covered with any sequence of circular disks of total area not smaller than 6.488|D|. Furthermore, any sequence of circular disks whose total area does not exceed 0.197|D| can be on-line packed into D.
KeywordsOn-line covering On-line packing Disk
Mathematics Subject Classification (2000)52C15 05B40
- Lassak, M.: A survey of algorithms for on-line packing and covering by sequences of convex bodies, Bolyai Soc. Math. Stud. 6, János Bolyai Math. Soc., Budapest, pp. 129–157 (1997)Google Scholar
© The Author(s) 2011