Efficient computation of 2-medians in a tree network with positive/negative weights

DOI10.1016/S1571-0653(04)00522-0zbMath1284.05078OpenAlexW2175791395MaRDI QIDQ5899357

D. Breton, Robert Benkoczi, Binay K. Bhattacharya

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00522-0

zbMATH Keywords

obnoxious facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Distance in graphs (05C12)

Related Items (1)

The multi-facility median problem with Pos/Neg weights on general graphs

Cites Work

• 2-medians in trees with pos/neg weights

This page was built for publication: Efficient computation of 2-medians in a tree network with positive/negative weights