A polynomial algorithm for thep-centdian problem on a tree

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O" /><255::AID-NET2>3.0.CO;2-O 10.1002/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-OzbMath1002.90045OpenAlexW2075478385MaRDI QIDQ4540080

José A. Moreno Pérez, Arie Tamir, Dionisio Perez-Britos

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199812)32:4<255::aid-net2>3.0.co;2-o

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (16)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Data relaying with constraints in hierarchical sensor networks ⋮ Algorithms for central-median paths with bounded length on trees ⋮ Revisiting \(k\)-sum optimization ⋮ A linear time algorithm for connected \(p\)-centdian problem on block graphs ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Maintaining centdians in a fully dynamic forest with top trees ⋮ A note on the minmax regret centdian location on trees ⋮ The 2-radius and 2-radiian problems on trees ⋮ The generalized \(p\)-centdian on network ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees ⋮ Improved complexity results for several multifacility location problems on trees ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Minimizing the sum of the \(k\) largest functions in linear time. ⋮ The centdian subtree on tree networks

This page was built for publication: A polynomial algorithm for thep-centdian problem on a tree