The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers

DOI10.1007/S10255-016-0609-2zbMATH Open1359.90054OpenAlexW2527052406MaRDI QIDQ519220FDOQ519220

Authors: Chun-song Bai, Liying Kang 

Publication date: 4 April 2017

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-016-0609-2

Recommendations

• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• 2-medians in trees with pos/neg weights
• 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
• scientific article; zbMATH DE number 2081038

zbMATH Keywords

obnoxious facilitieslocation problemssubtree-shaped customers

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Cites Work

• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• Algorithms – ESA 2005
• Obnoxious Facility Location on Graphs
• Title not available (Why is that?)
• 2-medians in trees with pos/neg weights
• Efficient computation of 2-medians in a tree network with positive/negative weights

Cited In (8)

• Efficient computation of 2-medians in a tree network with positive/negative weights
• The balanced 2-median and 2-maxian problems on a tree
• 2-medians in trees with pos/neg weights
• The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
• Mathematical Foundations of Computer Science 2003
• A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
• Efficient algorithms for two generalized 2-median problems and the group median problem on trees
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers

This page was built for publication: The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519220)