m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (Q3990564)
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: m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases |
scientific article; zbMATH DE number 38294
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases |
scientific article; zbMATH DE number 38294 |
Statements
m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (English)
0 references
28 June 1992
0 references
\(m\)-median problem
0 references
mutual communication
0 references
graph theoretic node selection
0 references
polynomial time algorithm
0 references
flow graph
0 references
0.8930849
0 references
0.8558837
0 references
0.84854776
0 references
0.8400428
0 references
0 references
0.83667016
0 references
0.8344284
0 references
