Maintaining centdians in a fully dynamic forest with top trees
type: Item
instance of: scholarly article
title: Maintaining centdians in a fully dynamic forest with top trees
zbMATH Open document ID: 1304.68036
author: Hung-Lung Wang
published in: Discrete Applied Mathematics
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6377068
zbMATH Keywords: fully dynamic forest
zbMATH Keywords: centdian
zbMATH Keywords: top tree
zbMATH Keywords: nonlocal search
MaRDI profile type: Publication
full work available at URL: j.dam.2014.09.013
OpenAlex ID: W1991526858
cites work: Maintaining information in fully dynamic trees with top trees
cites work: Q2721967
cites work: Dynamic and static algorithms for optimal placement of resources in a tree
cites work: Q4875187
cites work: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
cites work: Duality in the Cent-Dian of a Graph
cites work: Q5572939
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: A data structure for dynamic trees
cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
cites work: A polynomial algorithm for thep-centdian problem on a tree
cites work: The backup 2‐center and backup 2‐median problems on trees
DOI: 10.1016/J.DAM.2014.09.013
description: scientific article; zbMATH DE number 6377068