Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
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.
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Jianke Yang, Robin Walters, et al.
ICML 2023