An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521)
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)\) algorithm for the 1-maximin problem on a network |
scientific article; zbMATH DE number 1339945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(mn)\) algorithm for the 1-maximin problem on a network |
scientific article; zbMATH DE number 1339945 |
Statements
An \(O(mn)\) algorithm for the 1-maximin problem on a network (English)
0 references
23 November 1999
0 references
network location
0 references
undesirable facilities
0 references
maximin problem
0 references
0.91346496
0 references
0.89240533
0 references
0.89210004
0 references
0 references
0 references
0.87158954
0 references
0.8713438
0 references
