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
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Joachim Spoerhase / rank | |||
Property / author | |||
Property / author: Hans-Christoph Wirth / rank | |||
Property / author | |||
Property / author: Joachim Spoerhase / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Hans-Christoph Wirth / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080033794 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mixed covering of trees and the augmentation problem with odd diameter constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3971522 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414508 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The budgeted maximum coverage problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993417 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Maximum Coverage Location Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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