Finding the conditional location of a median path on a tree
From MaRDI portal
Publication:937298
DOI10.1016/j.ic.2008.04.004zbMath1153.90020OpenAlexW1986269281MaRDI QIDQ937298
Tzu-Chin Lin, Biing-Feng Wang, Shan-Chyun Ku, Chien-Hsin Lin
Publication date: 14 August 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.04.004
Programming involving graphs or networks (90C35) Continuous location (90B85) Discrete location and assignment (90B80)
Related Items (2)
Extensive facility location problems on networks: an updated review ⋮ Perspectives on modeling hub location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for central-median paths with bounded length on trees
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- A simple optimal parallel algorithm for a core of a tree
- The centdian subtree on tree networks
- Locating tree-shaped facilities using the ordered median objective
- On the conditional \(p\)-median problem
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Finding a 2-Core of a Tree in Linear Time
- Maintaining information in fully dynamic trees with top trees
- On locating path- or tree-shaped facilities on networks
- On finding the core of a tree with a specified length
- Technical Note—Conditional Location Problems on Networks
- The optimal location of a path or tree in a tree network
- Conditional p-Center Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A linear algorithm for a core of a tree
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- The generalized P‐forest problem on a tree network
- Finding kth paths and p-centers by generating and searching good data structures
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
- Finding cores of limited length
- Conditional location of path and tree shaped facilities on trees
This page was built for publication: Finding the conditional location of a median path on a tree