An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302)
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(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs |
scientific article; zbMATH DE number 961910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs |
scientific article; zbMATH DE number 961910 |
Statements
An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (English)
0 references
7 January 1997
0 references
facility location
0 references
\(p\)-median problems
0 references
\(p\)-coverage problems
0 references
tree graphs
0 references
complexity bound
0 references
\(p\)-median problem on trees
0 references
0 references
