Placing resources in a tree: Dynamic and static algorithms (Q4645181): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Dynamic and static algorithms for optimal placement of resources in a tree / 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: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A data structure for dynamic trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Maintaining Partial Sums / rank | |||
Normal rank | |||
Latest revision as of 20:27, 17 July 2024
scientific article; zbMATH DE number 6999435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Placing resources in a tree: Dynamic and static algorithms |
scientific article; zbMATH DE number 6999435 |
Statements
Placing resources in a tree: Dynamic and static algorithms (English)
0 references
10 January 2019
0 references
binary tree
0 references
canonical function
0 references
optimal placement
0 references
dynamic version
0 references
linear-time algorithm
0 references
