Finding the conditional location of a median path on a tree
type: Item
instance of: scholarly article
title: Finding the conditional location of a median path on a tree
zbMATH Open document ID: 1153.90020
author: Biing-Feng Wang
author: Tzu-Chin Lin
author: Chien-Hsin Lin
author: Shan-Chyun Ku
published in: Information and Computation
publication date: 2008-08-14T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 5312288
zbMATH Keywords: location theory
zbMATH Keywords: medians
zbMATH Keywords: centers
zbMATH Keywords: conditional location problems
zbMATH Keywords: trees
zbMATH Keywords: paths
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: j.ic.2008.04.004
OpenAlex ID: W1986269281
cites work: Maintaining information in fully dynamic trees with top trees
cites work: Finding cores of limited length
cites work: Algorithms for central-median paths with bounded length on trees
cites work: Technical Note—Conditional Location Problems on Networks
cites work: Q4695785
cites work: On the conditional \(p\)-median problem
cites work: Conditional p-Center Problems
cites work: Finding kth paths and p-centers by generating and searching good data structures
cites work: On locating path- or tree-shaped facilities on networks
cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Q5689811
cites work: An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
cites work: The optimal location of a path or tree in a tree network
cites work: On finding the core of a tree with a specified length
cites work: A linear algorithm for a core of a tree
cites work: A simple optimal parallel algorithm for a core of a tree
cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length
cites work: Q3992847
cites work: Locating tree-shaped facilities using the ordered median objective
cites work: Q4828922
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
cites work: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
cites work: The generalized P‐forest problem on a tree network
cites work: Conditional location of path and tree shaped facilities on trees
cites work: The centdian subtree on tree networks
cites work: Finding a 2-core of a tree in linear time
cites work: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
DOI: 10.1016/J.IC.2008.04.004
Recommended article: Q4808671
Recommended article: Locating A Median Subtree On A Network
Recommended article: Locating the median of a tree in real time
Recommended article: An algorithm for finding a \(k\)-median in a directed tree
Recommended article: The inverse 1-median problem on a tree and on a path
Recommended article: Algorithms for path medi-centers of a tree
Recommended article: The median procedure for n-trees
Recommended article: The median function on trees
Recommended article: Q3766560
Recommended article: On Parametric Medians of Trees
description: scientific article; zbMATH DE number 5312288