A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828)
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: A polynomial algorithm for the two-connections variant of the tree p-median problem |
scientific article; zbMATH DE number 6423616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem |
scientific article; zbMATH DE number 6423616 |
Statements
A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (English)
0 references
9 April 2015
0 references
location
0 references
dynamic programming
0 references
\(p\)-median problem
0 references
0.8111634850502014
0 references
0.8083011507987976
0 references
0.790859043598175
0 references
