scientific article; zbMATH DE number 2081038
From MaRDI portal
Publication:4474142
zbMATH Open1076.90548MaRDI QIDQ4474142FDOQ4474142
Authors: Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230768.htm
Title of this publication is not available (Why is that?)
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (17)
- The two‐median problem on Manhattan meshes
- The backup 2‐center and backup 2‐median problems on trees
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Title not available (Why is that?)
- The balanced 2-median and 2-maxian problems on a tree
- Algorithms for central-median paths with bounded length on trees
- 2-medians in trees with pos/neg weights
- 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
- Efficient computation of 2-medians in a tree network with positive/negative weights
- An algorithm for finding a \(k\)-median in a directed tree
- Algorithms – ESA 2005
- The 2-radius and 2-radiian problems on trees
- A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
- Efficient algorithms for finding <scp>2‐medians</scp> of a tree
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees
- The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474142)