Diameter partitioning (Q1076974)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Diameter partitioning |
scientific article; zbMATH DE number 3955874
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diameter partitioning |
scientific article; zbMATH DE number 3955874 |
Statements
Diameter partitioning (English)
0 references
1986
0 references
Given a set P of points, the diameter of P is the maximum distance of two points from P. In the paper, point sets are partitioned into two subsets satisfying certain requirements on the diameters, and cardinalities or displacement. The problems investigated about such partitions have algorithmic character.
0 references
partition of point sets
0 references
algorithm
0 references
diameter
0 references
