An algorithm for finding a \(k\)-median in a directed tree (Q1607050): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4377122 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4855565 / rank | |||
Normal rank | |||
Revision as of 11:05, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a \(k\)-median in a directed tree |
scientific article |
Statements
An algorithm for finding a \(k\)-median in a directed tree (English)
0 references
25 July 2002
0 references
\(k\)-median
0 references
