Finding a core of a tree with pos/neg weight

DOI10.1007/s00186-012-0394-5zbMath1260.05084MaRDI QIDQ1935945

Mehdi Zaferanieh, Jafar Fathali

Publication date: 20 February 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-012-0394-5

zbMATH Keywords

location theory; core; semi-obnoxious

Mathematics Subject Classification ID

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

Related Items

The extensive 1-median problem with radius on networks, Two paths location of a tree with positive or negative weights, Finding an optimal core on a tree network with M/G/c/c state-dependent queues, Fixed gate point location problems, An algorithm for solving the bi-objective median path-shaped facility on a tree network, Two Paths Location of a Tree with Positive or Negative Weights

Cites Work

• Unnamed Item
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• Finding the \(\ell\)-core of a tree
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• 2-medians in trees with pos/neg weights
• Algorithms for path medi-centers of a tree
• A branch-and-cut algorithm for the median-path problem
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for a core of a tree
• Obnoxious Facility Location on Graphs
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Computing the 2‐median on tree networks in O(n lg n) time
• Efficient computation of 2-medians in a tree network with positive/negative weights