scientific article; zbMATH DE number 2081038

MaRDI QIDQ4474142zbMATHFDO

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

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)

• Computing the 2‐median on tree networks in O(n lg n) time
• 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
• 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
• The 2-radius and 2-radiian problems on trees
• Algorithms for central-median paths with bounded length on trees
• A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
• The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
• An algorithm for finding a \(k\)-median in a directed tree
• The backup 2‐center and backup 2‐median problems on trees
• The two‐median problem on Manhattan meshes
• scientific article; zbMATH DE number 1834653 (Why is no real title available?)
• Efficient computation of 2-medians in a tree network with positive/negative weights
• Algorithms – ESA 2005
• The balanced 2-median and 2-maxian problems on a tree
• 2-medians in trees with pos/neg weights

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)