Dynamic and static algorithms for optimal placement of resources in a tree
type: Item
instance of: scholarly article
title: Dynamic and static algorithms for optimal placement of resources in a tree
zbMATH Open document ID: 0872.68139
DOI: 10.1016/0304-3975(96)00089-8
author: V. Auletta
author: Mimmo Parente
author: Giuseppe Persiano
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 983354
MaRDI profile type: Publication
full work available at URL: 0304-3975(96)00089-8
OpenAlex ID: W2007921877
cites work: Q4230327
cites work: Separator based sparsification for dynamic planar graph algorithms
cites work: Q4037428
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Q4036576
cites work: Fully dynamic planarity testing with applications
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem
cites work: A data structure for dynamic trees
cites work: On the Complexity of Maintaining Partial Sums
description: scientific article; zbMATH DE number 983354