The Obnoxious Center Problem on a Tree

DOI10.1137/S0895480198340967zbMath0986.90019OpenAlexW2020868174MaRDI QIDQ2753540

Yanpei Liu, Helidon Dollani, Günter Rote, Rainer E. Burkard

Publication date: 11 November 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480198340967

zbMATH Keywords

location problemscenter problemobnoxious facilitieslinear-time algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Complexity and performance of numerical algorithms (65Y20)

Related Items

Efficient algorithms for center problems in cactus networks ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Axiomatization and the antimean function on paths ⋮ Memetic algorithm for the antibandwidth maximization problem ⋮ The obnoxious center problem on weighted cactus graphs. ⋮ Center problems with pos/neg weights on trees