An algorithm for finding a \(k\)-median in a directed tree

DOI10.1016/S0020-0190(00)00026-0zbMath1003.68196OpenAlexW1973158291MaRDI QIDQ1607050

Giuseppe F. Italiano, Antoine Vigneron, Mordecai J. Golin, Bo Li, Lixin Gao

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00026-0

zbMATH Keywords

\(k\)-median

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

On the linear relaxation of the \(p\)-median problem ⋮ Optimizing server placement in distributed systems in the presence of competition ⋮ Comparison and analysis of ten static heuristics-based Internet data replication techniques ⋮ On the Location and p-Median Polytopes ⋮ On the \(p\)-median polytope of \(Y\)-free graphs ⋮ On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs ⋮ Joint object placement and node dimensioning for internet content distribution

Cites Work

• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for finding a \(k\)-median in a directed tree