Algorithms for path medi-centers of a tree
type: Item
instance of: scholarly article
title: Algorithms for path medi-centers of a tree
zbMATH Open document ID: 0967.90064
DOI: 10.1016/S0305-0548(99)00042-8
author: Igor Averbakh
author: Oded Berman
published in: Computers \& Operations Research
publication date: 2000-01-05T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1385349
zbMATH Keywords: optimal location
zbMATH Keywords: path
zbMATH Keywords: tree
zbMATH Keywords: minimax criteria
zbMATH Keywords: Pareto-optimal
MaRDI profile type: Publication
Recommended article: Algorithms for central-median paths with bounded length on trees
Recommended article: Q3821578
Recommended article: Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
Recommended article: An algorithm for finding a \(k\)-median in a directed tree
Recommended article: Efficient algorithms for finding <scp>2‐medians</scp> of a tree
Recommended article: A generalized algorithm for centrality problems on trees
Recommended article: Algorithms for finding P-centers on a weighted tree (for relatively small P)
Recommended article: A branch-and-cut algorithm for the median-path problem
Recommended article: Q3815150
Recommended article: The median procedure for n-trees
description: scientific article; zbMATH DE number 1385349