Placing resources in a tree: Dynamic and static algorithms (Q4645181): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Vincenzo Auletta / rank
Normal rank
 
Property / author
 
Property / author: Vincenzo Auletta / 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.1007/3-540-60084-1_77 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133734164 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    binary tree
    0 references
    canonical function
    0 references
    optimal placement
    0 references
    dynamic version
    0 references
    linear-time algorithm
    0 references
    0 references