An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129)
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(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees |
scientific article; zbMATH DE number 5722010
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees |
scientific article; zbMATH DE number 5722010 |
Statements
An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (English)
0 references
16 June 2010
0 references
graph algorithms
0 references
coverage
0 references
medianoid
0 references
tree
0 references
efficient algorithm
0 references
