Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Recently, Baiou and Barahona [M. Baiou, F. Barahona, On the p-median polytope of Y-free graphs. Discrete Optimization (in press, available online October 2007)] gave a characterization of the p-median polytope for Y-free graphs. In this paper, we give an alternative proof of this result by reducing the p-median problem in those graphs to a matching problem and then by building upon powerful results from the matching theory. © 2007 Elsevier Ltd. All rights reserved.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
M. Tismenetsky
International Journal of Computer Mathematics
Shu Tezuka
WSC 1991
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis