Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
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.
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Y.Y. Li, K.S. Leung, et al.
J Combin Optim