An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622)
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: An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) |
scientific article; zbMATH DE number 937088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) |
scientific article; zbMATH DE number 937088 |
Statements
An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (English)
0 references
31 March 1997
0 references
Euclidean weighted maximin problem
0 references
weighted Voronoi diagram
0 references
0.87334096
0 references
0 references
0.8666481
0 references
0 references
0 references
0.8623342
0 references
0.8619844
0 references
0.86076885
0 references
