Complexity results for the \(p\)-median problem with mutual communication (Q1317006)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 527397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for the \(p\)-median problem with mutual communication |
scientific article; zbMATH DE number 527397 |
Statements
Complexity results for the \(p\)-median problem with mutual communication (English)
0 references
25 July 1994
0 references
facility location
0 references
tree networks
0 references
\(p\)-median
0 references
mutual communication
0 references
undirected graph
0 references
0.823874294757843
0 references
0.7885398268699646
0 references
0.7744989395141602
0 references
0.7720212340354919
0 references
