Efficient algorithms for finding <scp>2‐medians</scp> of a tree

DOI10.1002/net.21978OpenAlexW2906613392MaRDI QIDQ6087120

Matthias F. M. Stallmann, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21978

zbMATH Keywords

sortingtreespriority queuelinear timebinary search\(2\)-median

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

The balanced 2-median and 2-maxian problems on a tree

Cites Work

• The \(p\)-median problem: a survey of metaheuristic approaches
• Efficient algorithms for two generalized 2-median problems and the group median problem on trees
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Solution methods for thep-median problem: An annotated bibliography
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Localizing 2‐medians on probabilistic and deterministic tree networks
• Convex Location Problems on Tree Networks
• Computing the 2‐median on tree networks in O(n lg n) time
• Algorithms – ESA 2005
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Efficient algorithms for finding <scp>2‐medians</scp> of a tree