Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
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.
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Heng Cao, Haifeng Xi, et al.
WSC 2003
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems