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): Difference between revisions
From MaRDI portal
Latest revision as of 22:57, 2 July 2024
scientific article
| 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 |
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
