Daphne Koller, Nimrod Megiddo
International Journal of Game Theory
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.
Daphne Koller, Nimrod Megiddo
International Journal of Game Theory
J. LaRue, C. Ting
Proceedings of SPIE 1989
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
A.C. Tam, W. Zapka, et al.
SPIE Microelectronic Processing Integration 1991