- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2191-0383
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On-line packing and covering a disk with disks ; volume:52 ; number:2 ; day:1 ; month:5 ; year:2011 ; pages:305-314 ; date:10.2011
Beiträge zur Algebra und Geometrie ; 52, Heft 2 (1.5.2011), 305-314, 10.2011
- Creator
-
Januszewski, Janusz
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s13366-011-0039-5
- URN
-
urn:nbn:de:101:1-2023050301280560008135
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:02 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Januszewski, Janusz
- SpringerLink (Online service)
Other Objects (12)
Packing Disks into Disks with Optimal Worst-Case Density
(Re)packing Equal Disks into Rectangle
Planet-disk interactions in non-isothermal disks
Planet-disk interactions in non-isothermal disks
Aspects of set packing, partitioning, and covering
Worst-Case Optimal Covering of Rectangles by Disks
COVERING A REDUCED POLYGON BY A DISK
Computational approaches to lattice packing and covering problems
On the packing/covering conjecture of infinite matroids
A Robust PTAS for Machine Covering and Packing
Covering a reduced spherical polygon by a disk
On the Complexity of Point Covering and Line Covering
Packing Disks into Disks with Optimal Worst-Case Density
(Re)packing Equal Disks into Rectangle
Planet-disk interactions in non-isothermal disks
Planet-disk interactions in non-isothermal disks
Aspects of set packing, partitioning, and covering
Worst-Case Optimal Covering of Rectangles by Disks
COVERING A REDUCED POLYGON BY A DISK
Computational approaches to lattice packing and covering problems
On the packing/covering conjecture of infinite matroids
A Robust PTAS for Machine Covering and Packing
Covering a reduced spherical polygon by a disk
On the Complexity of Point Covering and Line Covering
Packing Disks into Disks with Optimal Worst-Case Density
(Re)packing Equal Disks into Rectangle
Planet-disk interactions in non-isothermal disks
Planet-disk interactions in non-isothermal disks
Aspects of set packing, partitioning, and covering
Worst-Case Optimal Covering of Rectangles by Disks
COVERING A REDUCED POLYGON BY A DISK
Computational approaches to lattice packing and covering problems
On the packing/covering conjecture of infinite matroids
A Robust PTAS for Machine Covering and Packing
Covering a reduced spherical polygon by a disk