Finding a core of a tree with pos/neg weight
type: Item
instance of: scholarly article
title: Finding a core of a tree with pos/neg weight
zbMATH Open document ID: 1260.05084
author: Mehdi Zaferanieh
author: Jafar Fathali
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6137609
zbMATH Keywords: location theory
zbMATH Keywords: core
zbMATH Keywords: semi-obnoxious
MaRDI profile type: Publication
full work available at URL: s00186-012-0394-5
OpenAlex ID: W2001041237
cites work: A branch-and-cut algorithm for the median-path problem
cites work: Algorithms for path medi-centers of a tree
cites work: Finding the \(\ell\)-core of a tree
cites work: Efficient computation of 2-medians in a tree network with positive/negative weights
cites work: A polynomial method for the pos/neg weighted 3-median problem on a tree
cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
cites work: 2-medians in trees with pos/neg weights
cites work: Computing the 2‐median on tree networks in O(n lg n) time
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: A linear algorithm for a core of a tree
cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length
cites work: Obnoxious Facility Location on Graphs
cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
cites work: Q5606538
DOI: 10.1007/S00186-012-0394-5
description: scientific article; zbMATH DE number 6137609