Inverse 1-median problem on trees under weighted Hamming distance

@article{Guan2012Inverse1P,
title={Inverse 1-median problem on trees under weighted Hamming distance},
author={Xiucui Guan and Binwu Zhang},
journal={J. Global Optimization},
year={2012},
volume={54},
pages={75-82}
}

The inverse 1-median problem consists in modifying the weights of the customers at minimum cost such that a prespecified supplier becomes the 1-median of modified location problem. A linear time algorithm is first proposed for the inverse problem under weighted l∞ norm. Then two polynomial time algorithms with time complexities O(n log n) and O(n) are given for the problem under weighted bottleneck-Hamming distance, where n is the number of vertices. Finally, the problem under weighted sum… CONTINUE READING