Efficient algorithms for two generalized 2-median problems and the group median problem on trees
From MaRDI portal
Publication:1006061
DOI10.1016/J.TCS.2008.11.021zbMath1156.90451OpenAlexW2095512997MaRDI QIDQ1006061
Chi-Jen Lu, Chi-Yuan Chan, Shan-Chyun Ku, Biing-Feng Wang
Publication date: 17 March 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.021
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (3)
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Efficient algorithms for finding <scp>2‐medians</scp> of a tree ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network
Cites Work
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for a special case of disjoint set union
- Finding the two-core of a tree
- 2-medians in trees with pos/neg weights
- Group centre and group median of a tree
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Fast Algorithms for Finding Nearest Common Ancestors
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Locating Two Facilities on a Tree Subject to Distance Constraints
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Localizing 2‐medians on probabilistic and deterministic tree networks
- A polynomial algorithm for thep-centdian problem on a tree
- Computing the 2‐median on tree networks in O(n lg n) time
- Efficient algorithms for a constrained k-tree core problem in a tree network
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
This page was built for publication: Efficient algorithms for two generalized 2-median problems and the group median problem on trees
