Locating A Median Subtree On A Network

DOI10.1080/03155986.1991.11732163zbMath0732.90049OpenAlexW47157557MaRDI QIDQ3359989

Tae Ung Kim, Timothy J. Lowe, James E. Ward

Publication date: 1991

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1991.11732163

zbMATH Keywords

linear time algorithmcentral facilityconnected, unidirected network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Locating median cycles in networks ⋮ The extensive 1-median problem with radius on networks ⋮ A review of extensive facility location in networks

This page was built for publication: Locating A Median Subtree On A Network