Efficient algorithms for two generalized 2-median problems on trees
From MaRDI portal
Recommendations
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees
- 2-medians in trees with pos/neg weights
- A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
- Efficient computation of 2-medians in a tree network with positive/negative weights
- The balanced 2-median and 2-maxian problems on a tree
Cited in
(17)- Efficient algorithms for two generalized 2-median problems and the group median problem on trees
- 2-medians in trees with pos/neg weights
- An algorithm for finding a k-median in a directed tree
- A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
- The balanced 2-median and 2-maxian problems on a tree
- The two‐median problem on Manhattan meshes
- The k-median problem for directed trees (extended abstract)
- Computing the 2‐median on tree networks in O(n lg n) time
- 2-median location improvement problems under weighted \(l_1\) norm and \(l_\infty\) norm on trees
- The backup 2‐center and backup 2‐median problems on trees
- The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
- Algorithms – ESA 2005
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Efficient algorithms for finding <scp>2‐medians</scp> of a tree
- Algorithms for central-median paths with bounded length on trees
- The 2-radius and 2-radiian problems on trees
This page was built for publication: Efficient algorithms for two generalized 2-median problems on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474142)
