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

DOI10.1007/S10255-016-0609-2zbMath1359.90054OpenAlexW2527052406MaRDI QIDQ519220

Chun-song Bai, Li-ying 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

zbMATH Keywords

location problemsobnoxious facilitiessubtree-shaped customers

Mathematics Subject Classification ID

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

Cites Work

• 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
• 2-medians in trees with pos/neg weights
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Obnoxious Facility Location on Graphs
• Algorithms – ESA 2005
• Efficient computation of 2-medians in a tree network with positive/negative weights
• Unnamed Item

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