Imran Nasim, Michael E. Henderson
Mathematics
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.
Imran Nasim, Michael E. Henderson
Mathematics
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Heng Cao, Haifeng Xi, et al.
WSC 2003